Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575600028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652610918032

Running Version 202205111006
[2022-05-15 10:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 10:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 10:35:21] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2022-05-15 10:35:21] [INFO ] Transformed 542 places.
[2022-05-15 10:35:21] [INFO ] Transformed 621 transitions.
[2022-05-15 10:35:21] [INFO ] Found NUPN structural information;
[2022-05-15 10:35:21] [INFO ] Parsed PT model containing 542 places and 621 transitions in 575 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 172 places :
Symmetric choice reduction at 0 with 172 rule applications. Total rules 172 place count 370 transition count 449
Iterating global reduction 0 with 172 rules applied. Total rules applied 344 place count 370 transition count 449
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 414 place count 300 transition count 379
Iterating global reduction 0 with 70 rules applied. Total rules applied 484 place count 300 transition count 379
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 521 place count 263 transition count 342
Iterating global reduction 0 with 37 rules applied. Total rules applied 558 place count 263 transition count 342
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 574 place count 263 transition count 326
Applied a total of 574 rules in 221 ms. Remains 263 /542 variables (removed 279) and now considering 326/621 (removed 295) transitions.
// Phase 1: matrix 326 rows 263 cols
[2022-05-15 10:35:21] [INFO ] Computed 8 place invariants in 48 ms
[2022-05-15 10:35:22] [INFO ] Implicit Places using invariants in 755 ms returned []
// Phase 1: matrix 326 rows 263 cols
[2022-05-15 10:35:22] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-15 10:35:23] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
// Phase 1: matrix 326 rows 263 cols
[2022-05-15 10:35:23] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-15 10:35:23] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/542 places, 326/621 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/542 places, 326/621 transitions.
Support contains 35 out of 263 places after structural reductions.
[2022-05-15 10:35:23] [INFO ] Flatten gal took : 92 ms
[2022-05-15 10:35:23] [INFO ] Flatten gal took : 58 ms
[2022-05-15 10:35:24] [INFO ] Input system was already deterministic with 326 transitions.
Support contains 34 out of 263 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 1071 ms. (steps per millisecond=9 ) properties (out of 35) seen :20
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 326 rows 263 cols
[2022-05-15 10:35:25] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:25] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-15 10:35:26] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 10:35:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-15 10:35:26] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-15 10:35:27] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 71 ms to minimize.
[2022-05-15 10:35:27] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 2 ms to minimize.
[2022-05-15 10:35:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2022-05-15 10:35:27] [INFO ] After 1386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 302 ms.
[2022-05-15 10:35:27] [INFO ] After 1975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 11 properties in 150 ms.
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 239 edges and 263 vertex of which 37 / 263 are part of one of the 6 SCC in 12 ms
Free SCC test removed 31 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 232 transition count 249
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 193 transition count 249
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 79 place count 193 transition count 235
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 179 transition count 235
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 135 place count 151 transition count 207
Iterating global reduction 2 with 28 rules applied. Total rules applied 163 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 151 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 151 transition count 205
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 166 place count 150 transition count 205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 173 place count 143 transition count 198
Iterating global reduction 3 with 7 rules applied. Total rules applied 180 place count 143 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 187 place count 143 transition count 191
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 261 place count 106 transition count 154
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 273 place count 106 transition count 142
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 280 place count 99 transition count 135
Iterating global reduction 5 with 7 rules applied. Total rules applied 287 place count 99 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 99 transition count 134
Free-agglomeration rule applied 63 times.
Iterating global reduction 6 with 63 rules applied. Total rules applied 351 place count 99 transition count 71
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 91 edges and 36 vertex of which 21 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 88 rules applied. Total rules applied 439 place count 21 transition count 47
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 460 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 461 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 6 / 19 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 463 place count 16 transition count 25
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 469 place count 16 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 469 place count 16 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 475 place count 13 transition count 16
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 477 place count 13 transition count 14
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 11 with 4 rules applied. Total rules applied 481 place count 11 transition count 12
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 11 with 2 rules applied. Total rules applied 483 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 484 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 486 place count 10 transition count 8
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 492 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 493 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 494 place count 5 transition count 5
Applied a total of 494 rules in 161 ms. Remains 5 /263 variables (removed 258) and now considering 5/326 (removed 321) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/263 places, 5/326 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 241 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 241 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 241 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 226 transition count 288
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 226 transition count 288
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 226 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 225 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 225 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 279
Applied a total of 85 rules in 35 ms. Remains 225 /263 variables (removed 38) and now considering 279/326 (removed 47) transitions.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:29] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:29] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:29] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-15 10:35:29] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:29] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:30] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/263 places, 279/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/263 places, 279/326 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s127 1), p1:(AND (EQ s22 1) (EQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 1591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((F(p0)&&F(p1)))||(F(p0)&&p2)))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 237 edges and 263 vertex of which 37 / 263 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 231 transition count 253
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 191 transition count 253
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 81 place count 191 transition count 239
Deduced a syphon composed of 14 places in 15 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 109 place count 177 transition count 239
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 135 place count 151 transition count 213
Iterating global reduction 2 with 26 rules applied. Total rules applied 161 place count 151 transition count 213
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 144 transition count 206
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 144 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 182 place count 144 transition count 199
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 256 place count 107 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 106 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 106 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 106 transition count 160
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 265 place count 106 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 104 transition count 152
Applied a total of 267 rules in 179 ms. Remains 104 /263 variables (removed 159) and now considering 152/326 (removed 174) transitions.
[2022-05-15 10:35:30] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:30] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:30] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-15 10:35:30] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:30] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2022-05-15 10:35:31] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-15 10:35:31] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:31] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:31] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/263 places, 152/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/263 places, 152/326 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s99 1), p0:(EQ s100 1), p1:(AND (EQ s22 1) (EQ s39 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-01 finished in 1171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(G((G(p1)&&X(p1))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 243 transition count 306
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 243 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 243 transition count 305
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 230 transition count 292
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 230 transition count 292
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 230 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 229 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 229 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 229 transition count 285
Applied a total of 75 rules in 44 ms. Remains 229 /263 variables (removed 34) and now considering 285/326 (removed 41) transitions.
// Phase 1: matrix 285 rows 229 cols
[2022-05-15 10:35:31] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:31] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 285 rows 229 cols
[2022-05-15 10:35:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:32] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 229 cols
[2022-05-15 10:35:32] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:32] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/263 places, 285/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/263 places, 285/326 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s215 1), p1:(EQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1848 reset in 524 ms.
Product exploration explored 100000 steps with 1852 reset in 373 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Finished random walk after 248 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Support contains 1 out of 229 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Graph (trivial) has 207 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 197 transition count 224
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 169 transition count 224
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 169 transition count 210
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 155 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 144 transition count 199
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 144 transition count 199
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 183 place count 106 transition count 161
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 106 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 104 transition count 153
Applied a total of 191 rules in 71 ms. Remains 104 /229 variables (removed 125) and now considering 153/285 (removed 132) transitions.
[2022-05-15 10:35:34] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
// Phase 1: matrix 142 rows 104 cols
[2022-05-15 10:35:34] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-15 10:35:34] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
// Phase 1: matrix 142 rows 104 cols
[2022-05-15 10:35:34] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-15 10:35:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2022-05-15 10:35:34] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-15 10:35:34] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
// Phase 1: matrix 142 rows 104 cols
[2022-05-15 10:35:34] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:35] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/229 places, 153/285 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/229 places, 153/285 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 825 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 633907 steps, run visited all 1 properties in 1193 ms. (steps per millisecond=531 )
Probabilistic random walk after 633907 steps, saw 125670 distinct states, run finished after 1194 ms. (steps per millisecond=530 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 26606 steps with 2059 reset in 140 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-02 finished in 5393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(G(p0)))&&X((X((G(p1)&&p0))&&F(p0))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 241 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 241 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 241 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 226 transition count 288
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 226 transition count 288
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 226 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 225 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 225 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 279
Applied a total of 85 rules in 13 ms. Remains 225 /263 variables (removed 38) and now considering 279/326 (removed 47) transitions.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:37] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:37] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:37] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:37] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:37] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:37] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/263 places, 279/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/263 places, 279/326 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s219 1), p1:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-03 finished in 1199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(p1)||p2)))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 243 transition count 306
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 243 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 243 transition count 305
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 230 transition count 292
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 230 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 73 place count 230 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 229 transition count 285
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 229 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 229 transition count 284
Applied a total of 76 rules in 26 ms. Remains 229 /263 variables (removed 34) and now considering 284/326 (removed 42) transitions.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:38] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:38] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:39] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/263 places, 284/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/263 places, 284/326 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR p2 p1), true, p1]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(NEQ s197 1), p2:(EQ s209 1), p1:(EQ s34 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][false, false, false]]
Product exploration explored 100000 steps with 33296 reset in 565 ms.
Product exploration explored 100000 steps with 33271 reset in 482 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 436 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR p2 p1), true, p1]
Incomplete random walk after 10000 steps, including 185 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:41] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 10:35:41] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 10:35:41] [INFO ] After 277ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-15 10:35:41] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 206 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 2 ms
Free SCC test removed 31 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 198 transition count 218
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 170 transition count 218
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 170 transition count 204
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 156 transition count 204
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 145 transition count 193
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 145 transition count 193
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 187 place count 105 transition count 153
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 199 place count 105 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 205 place count 99 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 211 place count 99 transition count 135
Free-agglomeration rule applied 63 times.
Iterating global reduction 3 with 63 rules applied. Total rules applied 274 place count 99 transition count 72
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 95 edges and 36 vertex of which 16 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 88 rules applied. Total rules applied 362 place count 16 transition count 48
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 390 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 391 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 393 place count 12 transition count 19
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 397 place count 12 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 397 place count 12 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 401 place count 10 transition count 13
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 403 place count 10 transition count 11
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 8 with 4 rules applied. Total rules applied 407 place count 8 transition count 9
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 8 transition count 7
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 415 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 416 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 417 place count 3 transition count 4
Applied a total of 417 rules in 47 ms. Remains 3 /229 variables (removed 226) and now considering 4/284 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 3/229 places, 4/284 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F p2)]
Knowledge based reduction with 8 factoid took 645 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR p2 p1), true, p1]
Stuttering acceptance computed with spot in 100 ms :[(OR p2 p1), true, p1]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:42] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:42] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:42] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-15 10:35:43] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:43] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:43] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 284/284 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 487 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR p2 p1), true, p1]
Incomplete random walk after 10000 steps, including 186 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 284 rows 229 cols
[2022-05-15 10:35:44] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:44] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-15 10:35:44] [INFO ] After 215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 10:35:44] [INFO ] After 311ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-15 10:35:44] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 206 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 198 transition count 218
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 170 transition count 218
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 170 transition count 204
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 156 transition count 204
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 145 transition count 193
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 145 transition count 193
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 187 place count 105 transition count 153
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 199 place count 105 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 205 place count 99 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 211 place count 99 transition count 135
Free-agglomeration rule applied 63 times.
Iterating global reduction 3 with 63 rules applied. Total rules applied 274 place count 99 transition count 72
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 95 edges and 36 vertex of which 16 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 88 rules applied. Total rules applied 362 place count 16 transition count 48
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 390 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 391 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 393 place count 12 transition count 19
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 397 place count 12 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 397 place count 12 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 401 place count 10 transition count 13
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 403 place count 10 transition count 11
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 8 with 4 rules applied. Total rules applied 407 place count 8 transition count 9
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 8 transition count 7
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 415 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 416 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 417 place count 3 transition count 4
Applied a total of 417 rules in 45 ms. Remains 3 /229 variables (removed 226) and now considering 4/284 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 3/229 places, 4/284 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F p2)]
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR p2 p1), true, p1]
Stuttering acceptance computed with spot in 84 ms :[(OR p2 p1), true, p1]
Stuttering acceptance computed with spot in 119 ms :[(OR p2 p1), true, p1]
Product exploration explored 100000 steps with 33279 reset in 432 ms.
Product exploration explored 100000 steps with 33376 reset in 502 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 268 ms :[(OR p2 p1), true, p1]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 199 edges and 229 vertex of which 31 / 229 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 203 transition count 257
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 24 place count 203 transition count 258
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 42 place count 203 transition count 258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 66 place count 179 transition count 234
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 90 place count 179 transition count 234
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 129 place count 179 transition count 246
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 147 place count 161 transition count 228
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 165 place count 161 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 173 place count 161 transition count 263
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 176 place count 158 transition count 256
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 179 place count 158 transition count 256
Deduced a syphon composed of 52 places in 0 ms
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 194 place count 158 transition count 241
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 194 rules in 99 ms. Remains 158 /229 variables (removed 71) and now considering 241/284 (removed 43) transitions.
[2022-05-15 10:35:47] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-15 10:35:47] [INFO ] Flow matrix only has 231 transitions (discarded 10 similar events)
// Phase 1: matrix 231 rows 158 cols
[2022-05-15 10:35:47] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:47] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/229 places, 241/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/229 places, 241/284 transitions.
Product exploration explored 100000 steps with 33415 reset in 1107 ms.
Product exploration explored 100000 steps with 33234 reset in 879 ms.
Built C files in :
/tmp/ltsmin14777790056036107656
[2022-05-15 10:35:49] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14777790056036107656
Running compilation step : cd /tmp/ltsmin14777790056036107656;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin14777790056036107656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin14777790056036107656;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9283781639739420501.hoa' '--buchi-type=spotba'
LTSmin run took 941 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 13437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 241 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 241 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 241 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 226 transition count 288
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 226 transition count 288
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 226 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 225 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 225 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 279
Applied a total of 85 rules in 29 ms. Remains 225 /263 variables (removed 38) and now considering 279/326 (removed 47) transitions.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:51] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:52] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:52] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:52] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 225 cols
[2022-05-15 10:35:52] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-15 10:35:52] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/263 places, 279/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/263 places, 279/326 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-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:(EQ s88 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1567 steps with 28 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(p0)&&p1))) U p0))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 243 transition count 306
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 243 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 243 transition count 305
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 229 transition count 291
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 229 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 229 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 228 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 228 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 228 transition count 283
Applied a total of 78 rules in 27 ms. Remains 228 /263 variables (removed 35) and now considering 283/326 (removed 43) transitions.
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:52] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:52] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:52] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:53] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:53] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:53] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/263 places, 283/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/263 places, 283/326 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s197 1), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 1014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 242 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 242 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 43 place count 242 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 228 transition count 290
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 228 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 228 transition count 283
Applied a total of 78 rules in 14 ms. Remains 228 /263 variables (removed 35) and now considering 283/326 (removed 43) transitions.
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:53] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:53] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:53] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:54] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 228 cols
[2022-05-15 10:35:54] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:54] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/263 places, 283/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/263 places, 283/326 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 958 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||X(p1))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 242 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 242 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 43 place count 242 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 228 transition count 290
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 228 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 228 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 227 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 227 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 227 transition count 282
Applied a total of 80 rules in 20 ms. Remains 227 /263 variables (removed 36) and now considering 282/326 (removed 44) transitions.
// Phase 1: matrix 282 rows 227 cols
[2022-05-15 10:35:54] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:54] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 282 rows 227 cols
[2022-05-15 10:35:54] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 227 cols
[2022-05-15 10:35:55] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:55] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/263 places, 282/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/263 places, 282/326 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1), p1:(EQ s221 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4816 reset in 250 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-08 finished in 1363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 242 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 242 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 43 place count 242 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 228 transition count 290
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 228 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 228 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 227 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 227 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 227 transition count 281
Applied a total of 81 rules in 21 ms. Remains 227 /263 variables (removed 36) and now considering 281/326 (removed 45) transitions.
// Phase 1: matrix 281 rows 227 cols
[2022-05-15 10:35:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:56] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 281 rows 227 cols
[2022-05-15 10:35:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:56] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
// Phase 1: matrix 281 rows 227 cols
[2022-05-15 10:35:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:57] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/263 places, 281/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/263 places, 281/326 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s114 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3815 steps with 69 reset in 11 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-09 finished in 1204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(!(p0 U p1)))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 239 edges and 263 vertex of which 37 / 263 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 231 transition count 253
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 191 transition count 253
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 81 place count 191 transition count 239
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 109 place count 177 transition count 239
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 137 place count 149 transition count 211
Iterating global reduction 2 with 28 rules applied. Total rules applied 165 place count 149 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 149 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 166 place count 149 transition count 209
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 168 place count 148 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 175 place count 141 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 182 place count 141 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 141 transition count 195
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 259 place count 106 transition count 160
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 105 transition count 159
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 105 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 105 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 268 place count 105 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 270 place count 103 transition count 150
Applied a total of 270 rules in 62 ms. Remains 103 /263 variables (removed 160) and now considering 150/326 (removed 176) transitions.
[2022-05-15 10:35:57] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 103 cols
[2022-05-15 10:35:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:57] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-15 10:35:57] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 103 cols
[2022-05-15 10:35:57] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:57] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2022-05-15 10:35:57] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 10:35:57] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 103 cols
[2022-05-15 10:35:57] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:57] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/263 places, 150/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/263 places, 150/326 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, p1]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s98 1), p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11348 steps with 880 reset in 64 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-10 finished in 890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U G(p1)))||G(p2))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 209 edges and 263 vertex of which 30 / 263 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 237 transition count 258
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 44 rules applied. Total rules applied 87 place count 195 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 194 transition count 256
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 88 place count 194 transition count 242
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 116 place count 180 transition count 242
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 143 place count 153 transition count 215
Iterating global reduction 3 with 27 rules applied. Total rules applied 170 place count 153 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 171 place count 153 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 171 place count 153 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 152 transition count 213
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 179 place count 146 transition count 207
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 146 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 191 place count 146 transition count 201
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 267 place count 108 transition count 163
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 107 transition count 162
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 107 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 107 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 106 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 104 transition count 159
Applied a total of 274 rules in 69 ms. Remains 104 /263 variables (removed 159) and now considering 159/326 (removed 167) transitions.
[2022-05-15 10:35:58] [INFO ] Flow matrix only has 145 transitions (discarded 14 similar events)
// Phase 1: matrix 145 rows 104 cols
[2022-05-15 10:35:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-15 10:35:58] [INFO ] Flow matrix only has 145 transitions (discarded 14 similar events)
// Phase 1: matrix 145 rows 104 cols
[2022-05-15 10:35:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:58] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2022-05-15 10:35:58] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 10:35:58] [INFO ] Flow matrix only has 145 transitions (discarded 14 similar events)
// Phase 1: matrix 145 rows 104 cols
[2022-05-15 10:35:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:58] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/263 places, 159/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/263 places, 159/326 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s73 1), p2:(AND (EQ s73 1) (EQ s101 1)), p1:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((F(F(X(p0)))||p1))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 240 edges and 263 vertex of which 37 / 263 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 231 transition count 253
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 191 transition count 253
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 81 place count 191 transition count 239
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 109 place count 177 transition count 239
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 136 place count 150 transition count 212
Iterating global reduction 2 with 27 rules applied. Total rules applied 163 place count 150 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 150 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 150 transition count 210
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 166 place count 149 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 143 transition count 204
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 143 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 184 place count 143 transition count 198
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 256 place count 107 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 257 place count 106 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 106 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 106 transition count 160
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 265 place count 106 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 104 transition count 152
Applied a total of 267 rules in 62 ms. Remains 104 /263 variables (removed 159) and now considering 152/326 (removed 174) transitions.
[2022-05-15 10:35:59] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:59] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-15 10:35:59] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:35:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2022-05-15 10:35:59] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 10:35:59] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:59] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:35:59] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/263 places, 152/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/263 places, 152/326 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s83 1), p0:(EQ s92 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15746 steps with 1218 reset in 74 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-14 finished in 831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!(p0 U p1) U p2)||G(p3)))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 326/326 transitions.
Graph (trivial) has 237 edges and 263 vertex of which 36 / 263 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 232 transition count 255
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 192 transition count 255
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 81 place count 192 transition count 241
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 109 place count 178 transition count 241
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 137 place count 150 transition count 213
Iterating global reduction 2 with 28 rules applied. Total rules applied 165 place count 150 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 150 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 166 place count 150 transition count 211
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 168 place count 149 transition count 211
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 175 place count 142 transition count 204
Iterating global reduction 3 with 7 rules applied. Total rules applied 182 place count 142 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 142 transition count 197
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 259 place count 107 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 106 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 106 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 106 transition count 160
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 268 place count 106 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 270 place count 104 transition count 152
Applied a total of 270 rules in 55 ms. Remains 104 /263 variables (removed 159) and now considering 152/326 (removed 174) transitions.
[2022-05-15 10:35:59] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:35:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:36:00] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-15 10:36:00] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:00] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:36:00] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2022-05-15 10:36:00] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 10:36:00] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:00] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:36:00] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/263 places, 152/326 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/263 places, 152/326 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p1), (NOT p3), (AND p2 (NOT p3)), p2, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(EQ s72 1), p0:(EQ s76 1), p3:(EQ s69 0), p2:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 8493 reset in 391 ms.
Product exploration explored 100000 steps with 8436 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2 p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))))]
Knowledge based reduction with 34 factoid took 2300 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 376 ms :[true, (NOT p1), (NOT p3), p2, (AND p2 (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 795 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2022-05-15 10:36:05] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:05] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-15 10:36:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-15 10:36:05] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :3 sat :4 real:11
[2022-05-15 10:36:05] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :4 real:11
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 10:36:05] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :4 real:11
[2022-05-15 10:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-15 10:36:05] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :13
[2022-05-15 10:36:06] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :13
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-15 10:36:06] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :13
Fused 18 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 152/152 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 104 transition count 140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 98 transition count 134
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 98 transition count 134
Free-agglomeration rule applied 62 times.
Iterating global reduction 1 with 62 rules applied. Total rules applied 86 place count 98 transition count 72
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 61 edges and 35 vertex of which 20 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Graph (trivial) has 21 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 17 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 16 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 189 place count 16 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 13 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 13 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 11 transition count 12
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 205 place count 11 transition count 9
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 212 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 5 transition count 6
Applied a total of 214 rules in 18 ms. Remains 5 /104 variables (removed 99) and now considering 6/152 (removed 146) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/104 places, 6/152 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 13 properties in 2 ms. (steps per millisecond=8 )
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2 p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p1) p2 p0 p3))), (G (NOT (AND (NOT p1) p2 (NOT p0) p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2 p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F p2), (F (AND (NOT p1) p2 p0)), (F (AND p2 (NOT p3))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0 (NOT p3))), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (NOT p3)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p1) p0 p3)), (F (NOT (AND (NOT p1) (NOT p0) p3)))]
Knowledge based reduction with 39 factoid took 3390 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 277 ms :[(OR p2 p1 p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND p0 (NOT p1))), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2))]
Stuttering acceptance computed with spot in 255 ms :[(OR p2 p1 p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND p0 (NOT p1))), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2))]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 152/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2022-05-15 10:36:10] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:10] [INFO ] Computed 8 place invariants in 4 ms
[2022-05-15 10:36:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-15 10:36:10] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:10] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:36:10] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2022-05-15 10:36:10] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:10] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-15 10:36:10] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 152/152 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (OR p1 p2 p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR p1 p2 p3)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 12 factoid took 1008 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 251 ms :[(OR p2 p1 p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND p0 (NOT p1))), p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 803 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-15 10:36:12] [INFO ] Flow matrix only has 141 transitions (discarded 11 similar events)
// Phase 1: matrix 141 rows 104 cols
[2022-05-15 10:36:12] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-15 10:36:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:12] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2022-05-15 10:36:12] [INFO ] After 135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 10:36:13] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2022-05-15 10:36:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 10:36:13] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-15 10:36:13] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-15 10:36:13] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 104/104 places, 152/152 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 104 transition count 140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 98 transition count 134
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 98 transition count 134
Free-agglomeration rule applied 62 times.
Iterating global reduction 1 with 62 rules applied. Total rules applied 86 place count 98 transition count 72
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 61 edges and 35 vertex of which 20 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Graph (trivial) has 21 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 17 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 16 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 189 place count 16 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 13 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 13 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 11 transition count 12
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 205 place count 11 transition count 9
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 212 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 5 transition count 6
Applied a total of 214 rules in 26 ms. Remains 5 /104 variables (removed 99) and now considering 6/152 (removed 146) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/104 places, 6/152 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=4 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (OR p1 p2 p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (OR p1 p2 p3))), (G (OR p1 p2 p3))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND (NOT p1) p3 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p2 p0))]
Knowledge based reduction with 13 factoid took 1208 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), p2, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p1) p2))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), p2, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p1) p2))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), p2, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p1) p2))]
Product exploration explored 100000 steps with 8441 reset in 504 ms.
Product exploration explored 100000 steps with 8489 reset in 306 ms.
Built C files in :
/tmp/ltsmin9954963647316093443
[2022-05-15 10:36:16] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2022-05-15 10:36:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 10:36:16] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2022-05-15 10:36:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 10:36:16] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2022-05-15 10:36:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 10:36:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9954963647316093443
Running compilation step : cd /tmp/ltsmin9954963647316093443;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin9954963647316093443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9954963647316093443;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3102409932973286874.hoa' '--buchi-type=spotba'
LTSmin run took 254 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-15 finished in 17032 ms.
All properties solved by simple procedures.
Total runtime 56470 ms.

BK_STOP 1652610977191

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260575600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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