Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180000072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180000072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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-04b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716275825975

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 07:17:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:17:09] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2024-05-21 07:17:09] [INFO ] Transformed 390 places.
[2024-05-21 07:17:09] [INFO ] Transformed 388 transitions.
[2024-05-21 07:17:09] [INFO ] Found NUPN structural information;
[2024-05-21 07:17:09] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 350 transition count 348
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 350 transition count 348
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 350 transition count 342
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 102 place count 334 transition count 326
Iterating global reduction 1 with 16 rules applied. Total rules applied 118 place count 334 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 330 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 330 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 327 transition count 319
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 327 transition count 319
Applied a total of 132 rules in 151 ms. Remains 327 /390 variables (removed 63) and now considering 319/388 (removed 69) transitions.
// Phase 1: matrix 319 rows 327 cols
[2024-05-21 07:17:10] [INFO ] Computed 28 invariants in 15 ms
[2024-05-21 07:17:10] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 07:17:10] [INFO ] Invariant cache hit.
[2024-05-21 07:17:10] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2024-05-21 07:17:11] [INFO ] Invariant cache hit.
[2024-05-21 07:17:11] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 327/390 places, 319/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1640 ms. Remains : 327/390 places, 319/388 transitions.
Support contains 49 out of 327 places after structural reductions.
[2024-05-21 07:17:11] [INFO ] Flatten gal took : 73 ms
[2024-05-21 07:17:11] [INFO ] Flatten gal took : 42 ms
[2024-05-21 07:17:11] [INFO ] Input system was already deterministic with 319 transitions.
Support contains 45 out of 327 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 07:17:13] [INFO ] Invariant cache hit.
[2024-05-21 07:17:13] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2024-05-21 07:17:13] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:17:13] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 07:17:13] [INFO ] [Nat]Absence check using 27 positive place invariants in 26 ms returned sat
[2024-05-21 07:17:13] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 07:17:13] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 8 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 1 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 1 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1281 ms
[2024-05-21 07:17:16] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2024-05-21 07:17:16] [INFO ] Deduced a trap composed of 96 places in 190 ms of which 1 ms to minimize.
[2024-05-21 07:17:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
[2024-05-21 07:17:16] [INFO ] After 2749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-21 07:17:16] [INFO ] After 3141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 97 ms.
Support contains 14 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 319/319 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 327 transition count 217
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 114 rules applied. Total rules applied 216 place count 225 transition count 205
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 224 place count 219 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 226 place count 217 transition count 203
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 226 place count 217 transition count 164
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 304 place count 178 transition count 164
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 311 place count 171 transition count 157
Iterating global reduction 4 with 7 rules applied. Total rules applied 318 place count 171 transition count 157
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 318 place count 171 transition count 154
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 324 place count 168 transition count 154
Performed 55 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 434 place count 113 transition count 92
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 435 place count 113 transition count 91
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 450 place count 113 transition count 76
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 465 place count 98 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 466 place count 97 transition count 75
Reduce places removed 10 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 5 with 13 rules applied. Total rules applied 479 place count 87 transition count 72
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 483 place count 84 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 484 place count 83 transition count 71
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 484 place count 83 transition count 61
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 504 place count 73 transition count 61
Applied a total of 504 rules in 117 ms. Remains 73 /327 variables (removed 254) and now considering 61/319 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 73/327 places, 61/319 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 61 rows 73 cols
[2024-05-21 07:17:17] [INFO ] Computed 18 invariants in 2 ms
[2024-05-21 07:17:17] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:17:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-21 07:17:17] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 07:17:17] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 07:17:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 07:17:17] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 07:17:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 07:17:17] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-21 07:17:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2024-05-21 07:17:17] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-21 07:17:17] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 2 properties in 1 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-04b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 86 stabilizing places and 86 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 243 place count 212 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 251 place count 204 transition count 189
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 251 place count 204 transition count 149
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 331 place count 164 transition count 149
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 342 place count 153 transition count 138
Iterating global reduction 3 with 11 rules applied. Total rules applied 353 place count 153 transition count 138
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 353 place count 153 transition count 132
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 365 place count 147 transition count 132
Performed 53 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 471 place count 94 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 93 transition count 71
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 3 with 10 rules applied. Total rules applied 482 place count 86 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 485 place count 83 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 485 place count 83 transition count 64
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 493 place count 79 transition count 64
Applied a total of 493 rules in 69 ms. Remains 79 /327 variables (removed 248) and now considering 64/319 (removed 255) transitions.
// Phase 1: matrix 64 rows 79 cols
[2024-05-21 07:17:17] [INFO ] Computed 21 invariants in 2 ms
[2024-05-21 07:17:17] [INFO ] Implicit Places using invariants in 116 ms returned [32, 46, 60, 64, 68, 73, 78]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 118 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/327 places, 64/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 63 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 62 transition count 54
Applied a total of 20 rules in 24 ms. Remains 62 /72 variables (removed 10) and now considering 54/64 (removed 10) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-21 07:17:17] [INFO ] Computed 14 invariants in 2 ms
[2024-05-21 07:17:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 07:17:17] [INFO ] Invariant cache hit.
[2024-05-21 07:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:17:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/327 places, 54/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 381 ms. Remains : 62/327 places, 54/319 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 274 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 0) (EQ s42 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 15 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-02 finished in 728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((X(p2)||p1)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 313 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 306 transition count 297
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 306 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 305 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 305 transition count 296
Applied a total of 45 rules in 51 ms. Remains 305 /327 variables (removed 22) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 305 cols
[2024-05-21 07:17:18] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 07:17:18] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 07:17:18] [INFO ] Invariant cache hit.
[2024-05-21 07:17:18] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-21 07:17:18] [INFO ] Invariant cache hit.
[2024-05-21 07:17:18] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 305/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s102 0) (EQ s186 1)), p0:(OR (EQ s132 0) (EQ s220 1)), p2:(OR (EQ s263 0) (EQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 618 reset in 611 ms.
Product exploration explored 100000 steps with 622 reset in 440 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Finished Best-First random walk after 1699 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 305 /305 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-21 07:17:21] [INFO ] Invariant cache hit.
[2024-05-21 07:17:21] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 07:17:21] [INFO ] Invariant cache hit.
[2024-05-21 07:17:21] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-21 07:17:21] [INFO ] Invariant cache hit.
[2024-05-21 07:17:21] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 305/305 places, 296/296 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :1
Finished Best-First random walk after 1282 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=427 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 621 reset in 204 ms.
Product exploration explored 100000 steps with 617 reset in 437 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 305 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 305 transition count 292
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 96 place count 305 transition count 292
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 137 place count 305 transition count 292
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 209 place count 233 transition count 220
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 281 place count 233 transition count 220
Performed 72 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 353 place count 233 transition count 212
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 398 place count 188 transition count 167
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 443 place count 188 transition count 167
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 443 rules in 99 ms. Remains 188 /305 variables (removed 117) and now considering 167/296 (removed 129) transitions.
[2024-05-21 07:17:23] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 167 rows 188 cols
[2024-05-21 07:17:23] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 07:17:23] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/305 places, 167/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 188/305 places, 167/296 transitions.
Built C files in :
/tmp/ltsmin917964535042065305
[2024-05-21 07:17:23] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin917964535042065305
Running compilation step : cd /tmp/ltsmin917964535042065305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin917964535042065305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin917964535042065305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4509008709905551248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 305 /305 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 305 cols
[2024-05-21 07:17:39] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:17:39] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 07:17:39] [INFO ] Invariant cache hit.
[2024-05-21 07:17:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 07:17:39] [INFO ] Invariant cache hit.
[2024-05-21 07:17:39] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 305/305 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin7548256570080203523
[2024-05-21 07:17:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7548256570080203523
Running compilation step : cd /tmp/ltsmin7548256570080203523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 929 ms.
Running link step : cd /tmp/ltsmin7548256570080203523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7548256570080203523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6061916705094197958.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:17:54] [INFO ] Flatten gal took : 22 ms
[2024-05-21 07:17:54] [INFO ] Flatten gal took : 19 ms
[2024-05-21 07:17:54] [INFO ] Time to serialize gal into /tmp/LTL13832999307921210389.gal : 6 ms
[2024-05-21 07:17:54] [INFO ] Time to serialize properties into /tmp/LTL12106967583615573242.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13832999307921210389.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13734328445252801200.hoa' '-atoms' '/tmp/LTL12106967583615573242.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12106967583615573242.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13734328445252801200.hoa
Detected timeout of ITS tools.
[2024-05-21 07:18:10] [INFO ] Flatten gal took : 18 ms
[2024-05-21 07:18:10] [INFO ] Flatten gal took : 18 ms
[2024-05-21 07:18:10] [INFO ] Time to serialize gal into /tmp/LTL17516985186422681414.gal : 4 ms
[2024-05-21 07:18:10] [INFO ] Time to serialize properties into /tmp/LTL795485200378927429.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17516985186422681414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL795485200378927429.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((p200==0)||(p300==1))"))||(F(("((p155==0)||(p265==1))")||(X("((p346==0)||(p361==1))")))))))
Formula 0 simplified : F(X!"((p200==0)||(p300==1))" & G(!"((p155==0)||(p265==1))" & X!"((p346==0)||(p361==1))"))
Detected timeout of ITS tools.
[2024-05-21 07:18:25] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:18:25] [INFO ] Applying decomposition
[2024-05-21 07:18:25] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10889169003983956379.txt' '-o' '/tmp/graph10889169003983956379.bin' '-w' '/tmp/graph10889169003983956379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10889169003983956379.bin' '-l' '-1' '-v' '-w' '/tmp/graph10889169003983956379.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:18:25] [INFO ] Decomposing Gal with order
[2024-05-21 07:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:18:25] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 07:18:25] [INFO ] Flatten gal took : 76 ms
[2024-05-21 07:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 07:18:25] [INFO ] Time to serialize gal into /tmp/LTL14688633536869926545.gal : 11 ms
[2024-05-21 07:18:25] [INFO ] Time to serialize properties into /tmp/LTL14788216456068112677.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14688633536869926545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14788216456068112677.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((X("((i13.i0.u56.p200==0)||(i17.u92.p300==1))"))||(F(("((i10.u43.p155==0)||(i15.u77.p265==1))")||(X("((i19.i0.u112.p346==0)||(i20...178
Formula 0 simplified : F(X!"((i13.i0.u56.p200==0)||(i17.u92.p300==1))" & G(!"((i10.u43.p155==0)||(i15.u77.p265==1))" & X!"((i19.i0.u112.p346==0)||(i20.u117...168
Reverse transition relation is NOT exact ! Due to transitions t106, t130, t133, t143, t146, t167, t177, t200, t216, t225, t241, t308, t310, t311, t312, i0....747
Computing Next relation with stutter on 320 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13810756750757114065
[2024-05-21 07:18:40] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13810756750757114065
Running compilation step : cd /tmp/ltsmin13810756750757114065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 780 ms.
Running link step : cd /tmp/ltsmin13810756750757114065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13810756750757114065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>((X((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 97358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 326 transition count 207
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 237 place count 215 transition count 192
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 207 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 206 transition count 191
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 247 place count 206 transition count 151
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 166 transition count 151
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 337 place count 156 transition count 141
Iterating global reduction 4 with 10 rules applied. Total rules applied 347 place count 156 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 347 place count 156 transition count 135
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 359 place count 150 transition count 135
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 467 place count 96 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 95 transition count 73
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 478 place count 88 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 481 place count 85 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 481 place count 85 transition count 66
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 489 place count 81 transition count 66
Applied a total of 489 rules in 43 ms. Remains 81 /327 variables (removed 246) and now considering 66/319 (removed 253) transitions.
// Phase 1: matrix 66 rows 81 cols
[2024-05-21 07:18:55] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 07:18:55] [INFO ] Implicit Places using invariants in 131 ms returned [32, 46, 62, 66, 70, 75, 80]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 133 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/327 places, 66/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 59
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 16 place count 66 transition count 58
Applied a total of 16 rules in 8 ms. Remains 66 /74 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 66 cols
[2024-05-21 07:18:55] [INFO ] Computed 14 invariants in 0 ms
[2024-05-21 07:18:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 07:18:55] [INFO ] Invariant cache hit.
[2024-05-21 07:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:18:56] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/327 places, 58/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 66/327 places, 58/319 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s21 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 21 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-04 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 312 transition count 304
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 312 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 312 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 305 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 304 transition count 294
Applied a total of 48 rules in 28 ms. Remains 304 /327 variables (removed 23) and now considering 294/319 (removed 25) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 07:18:56] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:18:56] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 07:18:56] [INFO ] Invariant cache hit.
[2024-05-21 07:18:56] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 07:18:56] [INFO ] Invariant cache hit.
[2024-05-21 07:18:57] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/327 places, 294/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 969 ms. Remains : 304/327 places, 294/319 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-05 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:(OR (EQ s132 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-05 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 243 place count 212 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 251 place count 204 transition count 189
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 251 place count 204 transition count 150
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 329 place count 165 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 339 place count 155 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 349 place count 155 transition count 140
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 349 place count 155 transition count 133
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 363 place count 148 transition count 133
Performed 53 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 469 place count 95 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 94 transition count 72
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 3 with 10 rules applied. Total rules applied 480 place count 87 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 483 place count 84 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 483 place count 84 transition count 65
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 491 place count 80 transition count 65
Applied a total of 491 rules in 52 ms. Remains 80 /327 variables (removed 247) and now considering 65/319 (removed 254) transitions.
// Phase 1: matrix 65 rows 80 cols
[2024-05-21 07:18:57] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 07:18:57] [INFO ] Implicit Places using invariants in 119 ms returned [33, 47, 61, 65, 69, 74, 79]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 120 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/327 places, 65/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 63 transition count 55
Applied a total of 20 rules in 8 ms. Remains 63 /73 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-21 07:18:57] [INFO ] Computed 14 invariants in 1 ms
[2024-05-21 07:18:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 07:18:57] [INFO ] Invariant cache hit.
[2024-05-21 07:18:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:18:57] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/327 places, 55/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 63/327 places, 55/319 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s10 1)), p1:(AND (NEQ s18 0) (NEQ s10 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 4833 reset in 226 ms.
Product exploration explored 100000 steps with 4842 reset in 262 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 479 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:18:58] [INFO ] Invariant cache hit.
[2024-05-21 07:18:58] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-04b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04b-LTLCardinality-06 finished in 1363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G((F(!p1)||X(X(!p2)))))))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 312 transition count 304
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 312 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 312 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 305 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 305 transition count 295
Applied a total of 46 rules in 17 ms. Remains 305 /327 variables (removed 22) and now considering 295/319 (removed 24) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-21 07:18:58] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:18:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 07:18:58] [INFO ] Invariant cache hit.
[2024-05-21 07:18:59] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-21 07:18:59] [INFO ] Invariant cache hit.
[2024-05-21 07:18:59] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 295/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 862 ms. Remains : 305/327 places, 295/319 transitions.
Stuttering acceptance computed with spot in 480 ms :[(NOT p0), (AND p1 (NOT p0) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=5 dest: 7}], [{ cond=(AND p1 p0), acceptance={0} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p0), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s26 1), p1:(OR (EQ s259 0) (EQ s105 1)), p2:(OR (EQ s134 0) (EQ s299 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 712 reset in 364 ms.
Product exploration explored 100000 steps with 706 reset in 360 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (AND p1 p0 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 164 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 07:19:01] [INFO ] Invariant cache hit.
[2024-05-21 07:19:01] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2024-05-21 07:19:01] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:19:01] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:19:01] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2024-05-21 07:19:01] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:19:02] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 07:19:02] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-21 07:19:02] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 89 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (AND p1 p0 p2))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 396 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 420 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-21 07:19:03] [INFO ] Invariant cache hit.
[2024-05-21 07:19:03] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 07:19:03] [INFO ] Invariant cache hit.
[2024-05-21 07:19:04] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-21 07:19:04] [INFO ] Invariant cache hit.
[2024-05-21 07:19:04] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 305/305 places, 295/295 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), true, (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 221 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 07:19:05] [INFO ] Invariant cache hit.
[2024-05-21 07:19:05] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2024-05-21 07:19:05] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 07:19:05] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:19:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 18 ms returned sat
[2024-05-21 07:19:05] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 07:19:06] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 07:19:06] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 07:19:06] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 89 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), true, (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 359 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 337 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 492 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Product exploration explored 100000 steps with 725 reset in 313 ms.
Product exploration explored 100000 steps with 714 reset in 362 ms.
Built C files in :
/tmp/ltsmin2836889734655680412
[2024-05-21 07:19:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2836889734655680412
Running compilation step : cd /tmp/ltsmin2836889734655680412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 832 ms.
Running link step : cd /tmp/ltsmin2836889734655680412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2836889734655680412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4339879262500735118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 9 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-21 07:19:23] [INFO ] Invariant cache hit.
[2024-05-21 07:19:23] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 07:19:23] [INFO ] Invariant cache hit.
[2024-05-21 07:19:24] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-21 07:19:24] [INFO ] Invariant cache hit.
[2024-05-21 07:19:24] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1050 ms. Remains : 305/305 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin17115029035147804469
[2024-05-21 07:19:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17115029035147804469
Running compilation step : cd /tmp/ltsmin17115029035147804469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 938 ms.
Running link step : cd /tmp/ltsmin17115029035147804469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17115029035147804469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8170937762337857783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:19:39] [INFO ] Flatten gal took : 18 ms
[2024-05-21 07:19:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:19:39] [INFO ] Time to serialize gal into /tmp/LTL16072967658966701171.gal : 2 ms
[2024-05-21 07:19:39] [INFO ] Time to serialize properties into /tmp/LTL10035540363976329737.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16072967658966701171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15580854436480494202.hoa' '-atoms' '/tmp/LTL10035540363976329737.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10035540363976329737.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15580854436480494202.hoa
Detected timeout of ITS tools.
[2024-05-21 07:19:54] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:19:54] [INFO ] Flatten gal took : 10 ms
[2024-05-21 07:19:54] [INFO ] Time to serialize gal into /tmp/LTL31503945442476471.gal : 3 ms
[2024-05-21 07:19:54] [INFO ] Time to serialize properties into /tmp/LTL18060665660918169820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL31503945442476471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18060665660918169820.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(("(p29!=1)")U((G("(p29!=1)"))||(("(p29!=1)")&&(G((F(!("((p341==0)||(p161==1))")))||(X(X(!("((p204==0)||(p384==1))")))))))))))
Formula 0 simplified : G(F(G"((p341==0)||(p161==1))" & XX"((p204==0)||(p384==1))") U !"(p29!=1)")
Detected timeout of ITS tools.
[2024-05-21 07:20:10] [INFO ] Flatten gal took : 10 ms
[2024-05-21 07:20:10] [INFO ] Applying decomposition
[2024-05-21 07:20:10] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12391499629625936792.txt' '-o' '/tmp/graph12391499629625936792.bin' '-w' '/tmp/graph12391499629625936792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12391499629625936792.bin' '-l' '-1' '-v' '-w' '/tmp/graph12391499629625936792.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:20:10] [INFO ] Decomposing Gal with order
[2024-05-21 07:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:20:10] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 07:20:10] [INFO ] Flatten gal took : 31 ms
[2024-05-21 07:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 07:20:10] [INFO ] Time to serialize gal into /tmp/LTL17632662670655563119.gal : 7 ms
[2024-05-21 07:20:10] [INFO ] Time to serialize properties into /tmp/LTL16315512325376754523.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17632662670655563119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16315512325376754523.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(("(i2.u10.p29!=1)")U((G("(i2.u10.p29!=1)"))||(("(i2.u10.p29!=1)")&&(G((F(!("((i12.u109.p341==0)||(i1.u47.p161==1))")))||(X(X(!("(...205
Formula 0 simplified : G(F(G"((i12.u109.p341==0)||(i1.u47.p161==1))" & XX"((i12.u56.p204==0)||(i20.u127.p384==1))") U !"(i2.u10.p29!=1)")
Reverse transition relation is NOT exact ! Due to transitions t116, t119, t130, t133, t167, t177, t193, t200, t225, t241, t308, t310, t311, t312, i0.t118, ...712
Computing Next relation with stutter on 320 deadlock states
6 unique states visited
4 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
822 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,8.28544,280852,1,0,655661,220,3807,809423,128,536,1556001
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-04b-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-04b-LTLCardinality-09 finished in 81390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p0)||X(G(p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 307 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 306 transition count 296
Applied a total of 44 rules in 18 ms. Remains 306 /327 variables (removed 21) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-21 07:20:19] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:20:20] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 07:20:20] [INFO ] Invariant cache hit.
[2024-05-21 07:20:20] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-21 07:20:20] [INFO ] Invariant cache hit.
[2024-05-21 07:20:20] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 306/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s83 0) (EQ s96 1)), p1:(OR (EQ s203 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 379 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-10 finished in 874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(X(p1))&&G(p2)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 316 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 316 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 316 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 310 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 310 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 309 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 309 transition count 300
Applied a total of 37 rules in 20 ms. Remains 309 /327 variables (removed 18) and now considering 300/319 (removed 19) transitions.
// Phase 1: matrix 300 rows 309 cols
[2024-05-21 07:20:20] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 07:20:21] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 07:20:21] [INFO ] Invariant cache hit.
[2024-05-21 07:20:21] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-21 07:20:21] [INFO ] Invariant cache hit.
[2024-05-21 07:20:21] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/327 places, 300/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 948 ms. Remains : 309/327 places, 300/319 transitions.
Stuttering acceptance computed with spot in 501 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 8}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=1, aps=[p2:(AND (EQ s237 0) (EQ s225 1)), p1:(AND (EQ s201 0) (EQ s56 1)), p0:(AND (EQ s107 0) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, 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-04b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-11 finished in 1472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 307 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 306 transition count 296
Applied a total of 44 rules in 35 ms. Remains 306 /327 variables (removed 21) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-21 07:20:22] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:20:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 07:20:22] [INFO ] Invariant cache hit.
[2024-05-21 07:20:22] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-21 07:20:22] [INFO ] Invariant cache hit.
[2024-05-21 07:20:23] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 306/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (NEQ s58 0) (NEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-13 finished in 1372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 306 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 305 transition count 295
Applied a total of 46 rules in 33 ms. Remains 305 /327 variables (removed 22) and now considering 295/319 (removed 24) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-21 07:20:23] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 07:20:23] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 07:20:23] [INFO ] Invariant cache hit.
[2024-05-21 07:20:24] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-21 07:20:24] [INFO ] Invariant cache hit.
[2024-05-21 07:20:24] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 295/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 305/327 places, 295/319 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s172 0) (EQ s95 1)), p1:(OR (EQ s175 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 488 reset in 256 ms.
Product exploration explored 100000 steps with 492 reset in 293 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:20:25] [INFO ] Invariant cache hit.
[2024-05-21 07:20:25] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:20:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2024-05-21 07:20:25] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 07:20:26] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:20:26] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2024-05-21 07:20:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 07:20:26] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-21 07:20:26] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2024-05-21 07:20:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2024-05-21 07:20:26] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-21 07:20:26] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 295/295 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 305 transition count 188
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 120 rules applied. Total rules applied 227 place count 198 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 235 place count 190 transition count 175
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 235 place count 190 transition count 137
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 311 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 151 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 313 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 150 transition count 135
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 427 place count 94 transition count 72
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 443 place count 94 transition count 56
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 459 place count 78 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 77 transition count 55
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 33 rules applied. Total rules applied 493 place count 62 transition count 37
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 511 place count 44 transition count 37
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 511 place count 44 transition count 27
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 531 place count 34 transition count 27
Applied a total of 531 rules in 57 ms. Remains 34 /305 variables (removed 271) and now considering 27/295 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 34/305 places, 27/295 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-21 07:20:27] [INFO ] Invariant cache hit.
[2024-05-21 07:20:27] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 07:20:27] [INFO ] Invariant cache hit.
[2024-05-21 07:20:27] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-21 07:20:27] [INFO ] Invariant cache hit.
[2024-05-21 07:20:28] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 305/305 places, 295/295 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:20:28] [INFO ] Invariant cache hit.
[2024-05-21 07:20:28] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:20:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2024-05-21 07:20:28] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 07:20:28] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:20:29] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 1 ms to minimize.
[2024-05-21 07:20:29] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-21 07:20:29] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2024-05-21 07:20:29] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2024-05-21 07:20:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 619 ms
[2024-05-21 07:20:29] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-21 07:20:29] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 328 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 491 reset in 252 ms.
Product exploration explored 100000 steps with 491 reset in 288 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 305 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 305 transition count 291
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 102 place count 305 transition count 291
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 143 place count 305 transition count 291
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 226 transition count 212
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 226 transition count 212
Performed 68 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 369 place count 226 transition count 205
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 414 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 459 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 459 rules in 44 ms. Remains 181 /305 variables (removed 124) and now considering 160/295 (removed 135) transitions.
[2024-05-21 07:20:31] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 160 rows 181 cols
[2024-05-21 07:20:31] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:20:31] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/305 places, 160/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 181/305 places, 160/295 transitions.
Built C files in :
/tmp/ltsmin6399817445881306844
[2024-05-21 07:20:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6399817445881306844
Running compilation step : cd /tmp/ltsmin6399817445881306844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 668 ms.
Running link step : cd /tmp/ltsmin6399817445881306844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6399817445881306844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10912769907015496093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 5 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-21 07:20:46] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 07:20:46] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 07:20:46] [INFO ] Invariant cache hit.
[2024-05-21 07:20:46] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-21 07:20:46] [INFO ] Invariant cache hit.
[2024-05-21 07:20:47] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 305/305 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin10534034600894381017
[2024-05-21 07:20:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10534034600894381017
Running compilation step : cd /tmp/ltsmin10534034600894381017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 873 ms.
Running link step : cd /tmp/ltsmin10534034600894381017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10534034600894381017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5382346700652312330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:21:02] [INFO ] Flatten gal took : 11 ms
[2024-05-21 07:21:02] [INFO ] Flatten gal took : 9 ms
[2024-05-21 07:21:02] [INFO ] Time to serialize gal into /tmp/LTL10215115497653308042.gal : 2 ms
[2024-05-21 07:21:02] [INFO ] Time to serialize properties into /tmp/LTL12088774499481529149.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10215115497653308042.gal' '-t' 'CGAL' '-hoa' '/tmp/aut366465593846243770.hoa' '-atoms' '/tmp/LTL12088774499481529149.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12088774499481529149.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut366465593846243770.hoa
Detected timeout of ITS tools.
[2024-05-21 07:21:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 07:21:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 07:21:17] [INFO ] Time to serialize gal into /tmp/LTL15367963345324863352.gal : 2 ms
[2024-05-21 07:21:17] [INFO ] Time to serialize properties into /tmp/LTL17065595515751161199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15367963345324863352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17065595515751161199.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((p251==0)||(p145==1))")||(X(G("((p254==0)||(p19==1))"))))))
Formula 0 simplified : F(!"((p251==0)||(p145==1))" & XF!"((p254==0)||(p19==1))")
Detected timeout of ITS tools.
[2024-05-21 07:21:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 07:21:32] [INFO ] Applying decomposition
[2024-05-21 07:21:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10415240217626531018.txt' '-o' '/tmp/graph10415240217626531018.bin' '-w' '/tmp/graph10415240217626531018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10415240217626531018.bin' '-l' '-1' '-v' '-w' '/tmp/graph10415240217626531018.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:21:32] [INFO ] Decomposing Gal with order
[2024-05-21 07:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:21:32] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 07:21:32] [INFO ] Flatten gal took : 21 ms
[2024-05-21 07:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 07:21:32] [INFO ] Time to serialize gal into /tmp/LTL7370090840772103491.gal : 5 ms
[2024-05-21 07:21:32] [INFO ] Time to serialize properties into /tmp/LTL16967697123299731955.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7370090840772103491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16967697123299731955.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i22.i0.u71.p251==0)||(i10.u40.p145==1))")||(X(G("((i16.i0.u73.p254==0)||(i3.i0.u8.p19==1))"))))))
Formula 0 simplified : F(!"((i22.i0.u71.p251==0)||(i10.u40.p145==1))" & XF!"((i16.i0.u73.p254==0)||(i3.i0.u8.p19==1))")
Reverse transition relation is NOT exact ! Due to transitions t116, t119, t130, t133, t146, t167, t177, t200, t216, t225, t241, t307, t308, t310, t311, t31...771
Computing Next relation with stutter on 320 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14668470731104487151
[2024-05-21 07:21:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14668470731104487151
Running compilation step : cd /tmp/ltsmin14668470731104487151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin14668470731104487151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14668470731104487151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 99096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((X(p2)||p1)))))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-03
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 326 transition count 213
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 119 rules applied. Total rules applied 224 place count 221 transition count 199
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 234 place count 213 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 236 place count 211 transition count 197
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 236 place count 211 transition count 158
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 314 place count 172 transition count 158
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 324 place count 162 transition count 148
Iterating global reduction 4 with 10 rules applied. Total rules applied 334 place count 162 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 334 place count 162 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 348 place count 155 transition count 141
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 456 place count 101 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 100 transition count 79
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 4 with 8 rules applied. Total rules applied 465 place count 94 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 467 place count 92 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 467 place count 92 transition count 73
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 475 place count 88 transition count 73
Applied a total of 475 rules in 28 ms. Remains 88 /327 variables (removed 239) and now considering 73/319 (removed 246) transitions.
// Phase 1: matrix 73 rows 88 cols
[2024-05-21 07:22:03] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 07:22:03] [INFO ] Implicit Places using invariants in 79 ms returned [33, 49, 65, 82, 87]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 83/327 places, 73/319 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 76 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 73 transition count 63
Applied a total of 20 rules in 10 ms. Remains 73 /83 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-21 07:22:03] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 07:22:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 07:22:03] [INFO ] Invariant cache hit.
[2024-05-21 07:22:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:22:03] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 73/327 places, 63/319 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 332 ms. Remains : 73/327 places, 63/319 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s25 0) (EQ s37 1)), p0:(OR (EQ s30 0) (EQ s47 1)), p2:(OR (EQ s64 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5966 reset in 268 ms.
Product exploration explored 100000 steps with 5893 reset in 298 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 07:22:04] [INFO ] Invariant cache hit.
[2024-05-21 07:22:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 07:22:04] [INFO ] Invariant cache hit.
[2024-05-21 07:22:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:22:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 07:22:04] [INFO ] Invariant cache hit.
[2024-05-21 07:22:05] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 73/73 places, 63/63 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 219 steps, including 9 resets, run visited all 3 properties in 2 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5988 reset in 261 ms.
Product exploration explored 100000 steps with 5897 reset in 301 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 07:22:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 07:22:06] [INFO ] Invariant cache hit.
[2024-05-21 07:22:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 73/73 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin2019934385938291641
[2024-05-21 07:22:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2019934385938291641
Running compilation step : cd /tmp/ltsmin2019934385938291641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin2019934385938291641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2019934385938291641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14352158825163761267.hoa' '--buchi-type=spotba'
LTSmin run took 1615 ms.
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 6059 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-14
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 242 place count 212 transition count 190
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 250 place count 204 transition count 190
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 250 place count 204 transition count 151
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 328 place count 165 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 155 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 155 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 155 transition count 135
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 360 place count 149 transition count 135
Performed 50 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 460 place count 99 transition count 78
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 99 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 98 transition count 77
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 3 with 10 rules applied. Total rules applied 472 place count 91 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 475 place count 88 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 88 transition count 70
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 483 place count 84 transition count 70
Applied a total of 483 rules in 22 ms. Remains 84 /327 variables (removed 243) and now considering 70/319 (removed 249) transitions.
// Phase 1: matrix 70 rows 84 cols
[2024-05-21 07:22:09] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 07:22:09] [INFO ] Implicit Places using invariants in 69 ms returned [69, 73, 78, 83]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 80/327 places, 70/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 78 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 78 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 75 transition count 65
Applied a total of 10 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 75 cols
[2024-05-21 07:22:09] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 07:22:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 07:22:09] [INFO ] Invariant cache hit.
[2024-05-21 07:22:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:22:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/327 places, 65/319 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 318 ms. Remains : 75/327 places, 65/319 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s25 1)), p1:(OR (EQ s37 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5165 reset in 249 ms.
Product exploration explored 100000 steps with 5132 reset in 267 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 518 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:22:10] [INFO ] Invariant cache hit.
[2024-05-21 07:22:10] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:22:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-21 07:22:10] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:22:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:22:10] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 07:22:10] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 07:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-21 07:22:10] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 07:22:10] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 65/65 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 74 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 72 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 72 transition count 61
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 26 place count 72 transition count 42
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t183.t179.t291.t29.t63.t308.t30.t180.t15 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 15 rules applied. Total rules applied 41 place count 45 transition count 27
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 54 place count 32 transition count 27
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 54 place count 32 transition count 23
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 62 place count 28 transition count 23
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 5 with 2 rules applied. Total rules applied 64 place count 27 transition count 22
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 48 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 66 place count 25 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 25 transition count 20
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 70 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 73 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 74 place count 21 transition count 16
Applied a total of 74 rules in 20 ms. Remains 21 /75 variables (removed 54) and now considering 16/65 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 21/75 places, 16/65 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 07:22:10] [INFO ] Invariant cache hit.
[2024-05-21 07:22:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 07:22:10] [INFO ] Invariant cache hit.
[2024-05-21 07:22:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:22:11] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-21 07:22:11] [INFO ] Invariant cache hit.
[2024-05-21 07:22:11] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 75/75 places, 65/65 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 510 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:22:11] [INFO ] Invariant cache hit.
[2024-05-21 07:22:11] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:22:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-21 07:22:11] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:22:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:22:11] [INFO ] After 10ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 07:22:11] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 07:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-21 07:22:11] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 07:22:11] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 65/65 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 74 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 72 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 72 transition count 61
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 26 place count 72 transition count 42
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t183.t179.t291.t29.t63.t308.t30.t180.t15 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 15 rules applied. Total rules applied 41 place count 45 transition count 27
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 54 place count 32 transition count 27
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 54 place count 32 transition count 23
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 62 place count 28 transition count 23
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 5 with 2 rules applied. Total rules applied 64 place count 27 transition count 22
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 48 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 66 place count 25 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 25 transition count 20
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 70 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 73 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 74 place count 21 transition count 16
Applied a total of 74 rules in 17 ms. Remains 21 /75 variables (removed 54) and now considering 16/65 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 21/75 places, 16/65 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5141 reset in 236 ms.
Product exploration explored 100000 steps with 5132 reset in 265 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 07:22:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:22:13] [INFO ] Invariant cache hit.
[2024-05-21 07:22:13] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 75/75 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin4589496858268411668
[2024-05-21 07:22:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4589496858268411668
Running compilation step : cd /tmp/ltsmin4589496858268411668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin4589496858268411668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4589496858268411668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12919308016677518966.hoa' '--buchi-type=spotba'
LTSmin run took 9852 ms.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 14641 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 07:22:23] [INFO ] Flatten gal took : 9 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 314407 ms.

BK_STOP 1716276144692

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-04b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180000072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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