Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678485669012

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 22:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:01:10] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-10 22:01:10] [INFO ] Transformed 920 places.
[2023-03-10 22:01:10] [INFO ] Transformed 1057 transitions.
[2023-03-10 22:01:10] [INFO ] Found NUPN structural information;
[2023-03-10 22:01:10] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 327 places :
Symmetric choice reduction at 0 with 327 rule applications. Total rules 327 place count 593 transition count 730
Iterating global reduction 0 with 327 rules applied. Total rules applied 654 place count 593 transition count 730
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 798 place count 449 transition count 586
Iterating global reduction 0 with 144 rules applied. Total rules applied 942 place count 449 transition count 586
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 1023 place count 368 transition count 505
Iterating global reduction 0 with 81 rules applied. Total rules applied 1104 place count 368 transition count 505
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 1139 place count 368 transition count 470
Applied a total of 1139 rules in 146 ms. Remains 368 /920 variables (removed 552) and now considering 470/1057 (removed 587) transitions.
// Phase 1: matrix 470 rows 368 cols
[2023-03-10 22:01:11] [INFO ] Computed 10 place invariants in 25 ms
[2023-03-10 22:01:11] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-10 22:01:11] [INFO ] Invariant cache hit.
[2023-03-10 22:01:11] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-10 22:01:11] [INFO ] Invariant cache hit.
[2023-03-10 22:01:11] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 368/920 places, 470/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 368/920 places, 470/1057 transitions.
Support contains 40 out of 368 places after structural reductions.
[2023-03-10 22:01:12] [INFO ] Flatten gal took : 54 ms
[2023-03-10 22:01:12] [INFO ] Flatten gal took : 30 ms
[2023-03-10 22:01:12] [INFO ] Input system was already deterministic with 470 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-10 22:01:12] [INFO ] Invariant cache hit.
[2023-03-10 22:01:13] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-10 22:01:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 22:01:13] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-10 22:01:14] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 4 ms to minimize.
[2023-03-10 22:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-10 22:01:14] [INFO ] After 1140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-10 22:01:14] [INFO ] After 1758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 15 properties in 89 ms.
Support contains 6 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 333 edges and 368 vertex of which 49 / 368 are part of one of the 8 SCC in 3 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 327 transition count 375
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 282 transition count 375
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 91 place count 282 transition count 358
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 125 place count 265 transition count 358
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 153 place count 237 transition count 330
Iterating global reduction 2 with 28 rules applied. Total rules applied 181 place count 237 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 237 transition count 327
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 190 place count 231 transition count 321
Iterating global reduction 3 with 6 rules applied. Total rules applied 196 place count 231 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 201 place count 231 transition count 316
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 305 place count 179 transition count 264
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 321 place count 179 transition count 248
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 332 place count 168 transition count 237
Iterating global reduction 5 with 11 rules applied. Total rules applied 343 place count 168 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 346 place count 168 transition count 234
Free-agglomeration rule applied 117 times.
Iterating global reduction 6 with 117 rules applied. Total rules applied 463 place count 168 transition count 117
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 136 edges and 51 vertex of which 41 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 165 rules applied. Total rules applied 628 place count 41 transition count 70
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 642 place count 41 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 643 place count 40 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 646 place count 33 transition count 54
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 659 place count 32 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 659 place count 32 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 671 place count 26 transition count 36
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 676 place count 26 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 686 place count 21 transition count 26
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 688 place count 20 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 689 place count 20 transition count 24
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 694 place count 20 transition count 19
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 707 place count 12 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 709 place count 12 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 711 place count 10 transition count 12
Applied a total of 711 rules in 93 ms. Remains 10 /368 variables (removed 358) and now considering 12/470 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 10/368 places, 12/470 transitions.
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 336 edges and 368 vertex of which 49 / 368 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 326 transition count 380
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 279 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 278 transition count 379
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 97 place count 278 transition count 362
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 131 place count 261 transition count 362
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 162 place count 230 transition count 331
Iterating global reduction 3 with 31 rules applied. Total rules applied 193 place count 230 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 230 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 195 place count 230 transition count 328
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 229 transition count 328
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 204 place count 222 transition count 321
Iterating global reduction 4 with 7 rules applied. Total rules applied 211 place count 222 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 218 place count 222 transition count 314
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 316 place count 173 transition count 265
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 319 place count 170 transition count 262
Iterating global reduction 5 with 3 rules applied. Total rules applied 322 place count 170 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 325 place count 170 transition count 259
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 333 place count 170 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 335 place count 168 transition count 249
Applied a total of 335 rules in 94 ms. Remains 168 /368 variables (removed 200) and now considering 249/470 (removed 221) transitions.
[2023-03-10 22:01:15] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 168 cols
[2023-03-10 22:01:15] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:01:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 22:01:15] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:15] [INFO ] Invariant cache hit.
[2023-03-10 22:01:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-10 22:01:15] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 22:01:15] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:15] [INFO ] Invariant cache hit.
[2023-03-10 22:01:15] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/368 places, 249/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 168/368 places, 249/470 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s113 1), p0:(AND (EQ s76 0) (OR (EQ s54 0) (EQ s73 0) (EQ s150 0)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4774 steps with 331 reset in 67 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 349 transition count 451
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 349 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 349 transition count 449
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 336 transition count 436
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 336 transition count 436
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 75 place count 336 transition count 427
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 333 transition count 424
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 333 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 333 transition count 422
Applied a total of 83 rules in 30 ms. Remains 333 /368 variables (removed 35) and now considering 422/470 (removed 48) transitions.
// Phase 1: matrix 422 rows 333 cols
[2023-03-10 22:01:16] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-10 22:01:16] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 22:01:16] [INFO ] Invariant cache hit.
[2023-03-10 22:01:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-10 22:01:16] [INFO ] Invariant cache hit.
[2023-03-10 22:01:16] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/368 places, 422/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 333/368 places, 422/470 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 7}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=6 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=7 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s24 1), p2:(AND (EQ s172 1) (EQ s248 1) (EQ s324 1)), p0:(NEQ s306 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37507 reset in 400 ms.
Product exploration explored 100000 steps with 37625 reset in 337 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1858 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 154 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 22:01:20] [INFO ] Invariant cache hit.
[2023-03-10 22:01:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:01:21] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:8
[2023-03-10 22:01:21] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2023-03-10 22:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-10 22:01:21] [INFO ] After 202ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-10 22:01:21] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-10 22:01:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 22:01:21] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 22:01:21] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2023-03-10 22:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-10 22:01:21] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-10 22:01:21] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 6 properties in 20 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 300 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 4 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 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 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 221 transition count 301
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 221 transition count 301
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 245 place count 170 transition count 250
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 261 place count 170 transition count 234
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 162 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 162 transition count 226
Free-agglomeration rule applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 390 place count 162 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 154 rules applied. Total rules applied 544 place count 49 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 48 transition count 71
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 47 vertex of which 16 / 47 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 547 place count 39 transition count 71
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 563 place count 39 transition count 55
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 563 place count 39 transition count 47
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 579 place count 31 transition count 47
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 586 place count 31 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 600 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 607 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 630 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 631 place count 12 transition count 14
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 8 with 2 rules applied. Total rules applied 633 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 11 transition count 12
Applied a total of 634 rules in 65 ms. Remains 11 /333 variables (removed 322) and now considering 12/422 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 11/333 places, 12/422 transitions.
Finished random walk after 143 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=143 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) p0))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 27 factoid took 1911 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 333 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2023-03-10 22:01:24] [INFO ] Invariant cache hit.
[2023-03-10 22:01:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 22:01:24] [INFO ] Invariant cache hit.
[2023-03-10 22:01:24] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-10 22:01:24] [INFO ] Invariant cache hit.
[2023-03-10 22:01:24] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 333/333 places, 422/422 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 154 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 22:01:25] [INFO ] Invariant cache hit.
[2023-03-10 22:01:25] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:01:25] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 22:01:25] [INFO ] After 124ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 22:01:25] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-10 22:01:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:01:25] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:01:25] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-10 22:01:25] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 303 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 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 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 129 place count 220 transition count 300
Iterating global reduction 2 with 16 rules applied. Total rules applied 145 place count 220 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 220 transition count 299
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 248 place count 169 transition count 248
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 264 place count 169 transition count 232
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 272 place count 161 transition count 224
Iterating global reduction 4 with 8 rules applied. Total rules applied 280 place count 161 transition count 224
Free-agglomeration rule applied 115 times.
Iterating global reduction 4 with 115 rules applied. Total rules applied 395 place count 161 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 119 edges and 46 vertex of which 21 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 164 rules applied. Total rules applied 559 place count 21 transition count 61
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 594 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 595 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 6 with 2 rules applied. Total rules applied 597 place count 16 transition count 25
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 603 place count 16 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 603 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 8 with 6 rules applied. Total rules applied 609 place count 13 transition count 16
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 611 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 9 with 4 rules applied. Total rules applied 615 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 9 with 2 rules applied. Total rules applied 617 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 620 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 9 with 6 rules applied. Total rules applied 626 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 627 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 628 place count 5 transition count 5
Applied a total of 628 rules in 36 ms. Remains 5 /333 variables (removed 328) and now considering 5/422 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 5/333 places, 5/422 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 37358 reset in 220 ms.
Product exploration explored 100000 steps with 37533 reset in 223 ms.
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 332 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 332 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 332 transition count 420
Applied a total of 3 rules in 15 ms. Remains 332 /333 variables (removed 1) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 332 cols
[2023-03-10 22:01:27] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 22:01:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 22:01:27] [INFO ] Invariant cache hit.
[2023-03-10 22:01:27] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-10 22:01:27] [INFO ] Invariant cache hit.
[2023-03-10 22:01:28] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/333 places, 420/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 332/333 places, 420/422 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 11856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 334 transition count 433
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 334 transition count 433
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 334 transition count 424
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 332 transition count 422
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 332 transition count 422
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 332 transition count 421
Applied a total of 85 rules in 18 ms. Remains 332 /368 variables (removed 36) and now considering 421/470 (removed 49) transitions.
// Phase 1: matrix 421 rows 332 cols
[2023-03-10 22:01:28] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 22:01:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 22:01:28] [INFO ] Invariant cache hit.
[2023-03-10 22:01:28] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-10 22:01:28] [INFO ] Invariant cache hit.
[2023-03-10 22:01:28] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/368 places, 421/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 332/368 places, 421/470 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s210 1), p0:(EQ s326 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-03 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(!p1) U (p0&&G(!p1)))))))'
Support contains 3 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 349 transition count 451
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 349 transition count 451
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 349 transition count 448
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 338 transition count 437
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 338 transition count 437
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 336 transition count 427
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 336 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 336 transition count 425
Applied a total of 77 rules in 13 ms. Remains 336 /368 variables (removed 32) and now considering 425/470 (removed 45) transitions.
// Phase 1: matrix 425 rows 336 cols
[2023-03-10 22:01:28] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:01:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 22:01:28] [INFO ] Invariant cache hit.
[2023-03-10 22:01:29] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-10 22:01:29] [INFO ] Invariant cache hit.
[2023-03-10 22:01:29] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/368 places, 425/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 336/368 places, 425/470 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s145 1), p1:(OR (AND (EQ s284 1) (EQ s145 1)) (EQ s324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-04 finished in 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U p2))))'
Support contains 3 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 338 edges and 368 vertex of which 49 / 368 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 326 transition count 379
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 278 transition count 379
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 97 place count 278 transition count 362
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 131 place count 261 transition count 362
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 162 place count 230 transition count 331
Iterating global reduction 2 with 31 rules applied. Total rules applied 193 place count 230 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 196 place count 230 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 196 place count 230 transition count 327
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 198 place count 229 transition count 327
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 203 place count 224 transition count 322
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 224 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 213 place count 224 transition count 317
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 311 place count 175 transition count 268
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 315 place count 171 transition count 264
Iterating global reduction 4 with 4 rules applied. Total rules applied 319 place count 171 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 323 place count 171 transition count 260
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 331 place count 171 transition count 252
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 333 place count 169 transition count 250
Applied a total of 333 rules in 43 ms. Remains 169 /368 variables (removed 199) and now considering 250/470 (removed 220) transitions.
[2023-03-10 22:01:29] [INFO ] Flow matrix only has 235 transitions (discarded 15 similar events)
// Phase 1: matrix 235 rows 169 cols
[2023-03-10 22:01:29] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:01:29] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 22:01:29] [INFO ] Flow matrix only has 235 transitions (discarded 15 similar events)
[2023-03-10 22:01:29] [INFO ] Invariant cache hit.
[2023-03-10 22:01:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-10 22:01:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 22:01:29] [INFO ] Flow matrix only has 235 transitions (discarded 15 similar events)
[2023-03-10 22:01:29] [INFO ] Invariant cache hit.
[2023-03-10 22:01:29] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/368 places, 250/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 397 ms. Remains : 169/368 places, 250/470 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s135 0) (EQ s81 0)), p2:(EQ s160 1), p1:(EQ s81 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-05 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U X((p1 U (p2||G(p1)))))))))'
Support contains 7 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 349 transition count 451
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 349 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 349 transition count 449
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 337 transition count 437
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 337 transition count 437
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 337 transition count 429
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 335 transition count 427
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 335 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 335 transition count 426
Applied a total of 77 rules in 12 ms. Remains 335 /368 variables (removed 33) and now considering 426/470 (removed 44) transitions.
// Phase 1: matrix 426 rows 335 cols
[2023-03-10 22:01:29] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-10 22:01:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 22:01:29] [INFO ] Invariant cache hit.
[2023-03-10 22:01:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-10 22:01:30] [INFO ] Invariant cache hit.
[2023-03-10 22:01:30] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/368 places, 426/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 335/368 places, 426/470 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s111 1) (AND (EQ s121 1) (EQ s209 1) (EQ s302 1))), p2:(AND (EQ s133 1) (EQ s334 1) (NEQ s117 1)), p1:(NEQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63573 steps with 975 reset in 120 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 334 transition count 433
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 334 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 334 transition count 425
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 331 transition count 422
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 331 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 331 transition count 420
Applied a total of 87 rules in 17 ms. Remains 331 /368 variables (removed 37) and now considering 420/470 (removed 50) transitions.
// Phase 1: matrix 420 rows 331 cols
[2023-03-10 22:01:30] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:01:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-10 22:01:30] [INFO ] Invariant cache hit.
[2023-03-10 22:01:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-10 22:01:30] [INFO ] Invariant cache hit.
[2023-03-10 22:01:31] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/368 places, 420/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 331/368 places, 420/470 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s144 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33518 steps with 510 reset in 48 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-07 finished in 686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&F(p1))))))'
Support contains 2 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 333 transition count 432
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 333 transition count 432
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 333 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 330 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 330 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 330 transition count 418
Applied a total of 90 rules in 17 ms. Remains 330 /368 variables (removed 38) and now considering 418/470 (removed 52) transitions.
// Phase 1: matrix 418 rows 330 cols
[2023-03-10 22:01:31] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:01:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 22:01:31] [INFO ] Invariant cache hit.
[2023-03-10 22:01:31] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-10 22:01:31] [INFO ] Invariant cache hit.
[2023-03-10 22:01:31] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/368 places, 418/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 330/368 places, 418/470 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s33 1), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-08 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&(p1||F(p2)))))'
Support contains 2 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 334 transition count 433
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 334 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 334 transition count 425
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 331 transition count 422
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 331 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 331 transition count 420
Applied a total of 87 rules in 18 ms. Remains 331 /368 variables (removed 37) and now considering 420/470 (removed 50) transitions.
// Phase 1: matrix 420 rows 331 cols
[2023-03-10 22:01:32] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 22:01:32] [INFO ] Invariant cache hit.
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-10 22:01:32] [INFO ] Invariant cache hit.
[2023-03-10 22:01:32] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/368 places, 420/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 331/368 places, 420/470 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s136 0), p2:(EQ s180 0), p0:(EQ s180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][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-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-09 finished in 694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 339 edges and 368 vertex of which 43 / 368 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 331 transition count 384
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 283 transition count 384
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 97 place count 283 transition count 366
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 133 place count 265 transition count 366
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 164 place count 234 transition count 335
Iterating global reduction 2 with 31 rules applied. Total rules applied 195 place count 234 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 198 place count 234 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 198 place count 234 transition count 331
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 200 place count 233 transition count 331
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 207 place count 226 transition count 324
Iterating global reduction 3 with 7 rules applied. Total rules applied 214 place count 226 transition count 324
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 226 transition count 317
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 327 place count 173 transition count 264
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 331 place count 169 transition count 260
Iterating global reduction 4 with 4 rules applied. Total rules applied 335 place count 169 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 339 place count 169 transition count 256
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 5 with 2 rules applied. Total rules applied 341 place count 168 transition count 256
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 350 place count 168 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 352 place count 166 transition count 245
Applied a total of 352 rules in 47 ms. Remains 166 /368 variables (removed 202) and now considering 245/470 (removed 225) transitions.
[2023-03-10 22:01:32] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
// Phase 1: matrix 231 rows 166 cols
[2023-03-10 22:01:32] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 22:01:32] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
[2023-03-10 22:01:32] [INFO ] Invariant cache hit.
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-10 22:01:33] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 22:01:33] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/368 places, 245/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 166/368 places, 245/470 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-10 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 341 edges and 368 vertex of which 49 / 368 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 326 transition count 379
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 278 transition count 379
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 97 place count 278 transition count 362
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 131 place count 261 transition count 362
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 163 place count 229 transition count 330
Iterating global reduction 2 with 32 rules applied. Total rules applied 195 place count 229 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 198 place count 229 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 198 place count 229 transition count 326
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 200 place count 228 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 207 place count 221 transition count 319
Iterating global reduction 3 with 7 rules applied. Total rules applied 214 place count 221 transition count 319
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 221 transition count 312
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 321 place count 171 transition count 262
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 324 place count 168 transition count 259
Iterating global reduction 4 with 3 rules applied. Total rules applied 327 place count 168 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 330 place count 168 transition count 256
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 338 place count 168 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 340 place count 166 transition count 246
Applied a total of 340 rules in 52 ms. Remains 166 /368 variables (removed 202) and now considering 246/470 (removed 224) transitions.
[2023-03-10 22:01:33] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
// Phase 1: matrix 231 rows 166 cols
[2023-03-10 22:01:33] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 22:01:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 22:01:33] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-10 22:01:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:01:33] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:33] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/368 places, 246/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 166/368 places, 246/470 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s134 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 333 transition count 432
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 333 transition count 432
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 333 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 330 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 330 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 330 transition count 418
Applied a total of 90 rules in 12 ms. Remains 330 /368 variables (removed 38) and now considering 418/470 (removed 52) transitions.
// Phase 1: matrix 418 rows 330 cols
[2023-03-10 22:01:33] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-10 22:01:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:33] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:34] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/368 places, 418/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 330/368 places, 418/470 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s324 1), p1:(OR (EQ s37 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(F(p1)) U p2)))))'
Support contains 3 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 348 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 348 transition count 450
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 348 transition count 447
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 336 transition count 435
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 336 transition count 435
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 336 transition count 428
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 333 transition count 425
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 333 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 333 transition count 423
Applied a total of 82 rules in 18 ms. Remains 333 /368 variables (removed 35) and now considering 423/470 (removed 47) transitions.
// Phase 1: matrix 423 rows 333 cols
[2023-03-10 22:01:34] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-10 22:01:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-10 22:01:34] [INFO ] Invariant cache hit.
[2023-03-10 22:01:34] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-10 22:01:34] [INFO ] Invariant cache hit.
[2023-03-10 22:01:34] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/368 places, 423/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 333/368 places, 423/470 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s223 1), p1:(EQ s12 1), p0:(EQ s280 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 347 transition count 449
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 347 transition count 446
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 333 transition count 432
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 333 transition count 432
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 333 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 330 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 330 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 330 transition count 418
Applied a total of 90 rules in 17 ms. Remains 330 /368 variables (removed 38) and now considering 418/470 (removed 52) transitions.
// Phase 1: matrix 418 rows 330 cols
[2023-03-10 22:01:35] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 22:01:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 22:01:35] [INFO ] Invariant cache hit.
[2023-03-10 22:01:35] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-10 22:01:35] [INFO ] Invariant cache hit.
[2023-03-10 22:01:35] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/368 places, 418/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 330/368 places, 418/470 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s260 0), p0:(EQ s55 0)], 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]]
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-14 finished in 1135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 328 edges and 368 vertex of which 37 / 368 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 336 transition count 391
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 290 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 289 transition count 390
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 95 place count 289 transition count 370
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 135 place count 269 transition count 370
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 164 place count 240 transition count 341
Iterating global reduction 3 with 29 rules applied. Total rules applied 193 place count 240 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 196 place count 240 transition count 338
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 196 place count 240 transition count 336
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 200 place count 238 transition count 336
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 208 place count 230 transition count 328
Iterating global reduction 4 with 8 rules applied. Total rules applied 216 place count 230 transition count 328
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 224 place count 230 transition count 320
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 334 place count 175 transition count 265
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 337 place count 172 transition count 262
Iterating global reduction 5 with 3 rules applied. Total rules applied 340 place count 172 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 343 place count 172 transition count 259
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 349 place count 169 transition count 277
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 358 place count 169 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 168 transition count 267
Applied a total of 359 rules in 49 ms. Remains 168 /368 variables (removed 200) and now considering 267/470 (removed 203) transitions.
[2023-03-10 22:01:36] [INFO ] Flow matrix only has 254 transitions (discarded 13 similar events)
// Phase 1: matrix 254 rows 168 cols
[2023-03-10 22:01:36] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:01:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-10 22:01:36] [INFO ] Flow matrix only has 254 transitions (discarded 13 similar events)
[2023-03-10 22:01:36] [INFO ] Invariant cache hit.
[2023-03-10 22:01:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:01:36] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-10 22:01:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 22:01:36] [INFO ] Flow matrix only has 254 transitions (discarded 13 similar events)
[2023-03-10 22:01:36] [INFO ] Invariant cache hit.
[2023-03-10 22:01:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/368 places, 267/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 168/368 places, 267/470 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s99 1), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-08b-LTLFireability-01
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 368/368 places, 470/470 transitions.
Graph (trivial) has 335 edges and 368 vertex of which 49 / 368 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 326 transition count 381
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 280 transition count 381
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 93 place count 280 transition count 364
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 127 place count 263 transition count 364
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 158 place count 232 transition count 333
Iterating global reduction 2 with 31 rules applied. Total rules applied 189 place count 232 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 191 place count 232 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 191 place count 232 transition count 330
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 193 place count 231 transition count 330
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 224 transition count 323
Iterating global reduction 3 with 7 rules applied. Total rules applied 207 place count 224 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 214 place count 224 transition count 316
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 312 place count 175 transition count 267
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 316 place count 171 transition count 263
Iterating global reduction 4 with 4 rules applied. Total rules applied 320 place count 171 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 171 transition count 259
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 332 place count 171 transition count 251
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 171 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 169 transition count 249
Applied a total of 335 rules in 42 ms. Remains 169 /368 variables (removed 199) and now considering 249/470 (removed 221) transitions.
[2023-03-10 22:01:37] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 169 cols
[2023-03-10 22:01:37] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:01:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 22:01:37] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:37] [INFO ] Invariant cache hit.
[2023-03-10 22:01:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-10 22:01:37] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:37] [INFO ] Invariant cache hit.
[2023-03-10 22:01:37] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 169/368 places, 249/470 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 327 ms. Remains : 169/368 places, 249/470 transitions.
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 7}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=6 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=7 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=7 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s7 1), p2:(AND (EQ s70 1) (EQ s105 1) (EQ s164 1)), p0:(NEQ s146 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37413 reset in 472 ms.
Product exploration explored 100000 steps with 37439 reset in 504 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 p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1572 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 701 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 22:01:40] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:40] [INFO ] Invariant cache hit.
[2023-03-10 22:01:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-10 22:01:41] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-10 22:01:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-10 22:01:41] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 22:01:41] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-10 22:01:41] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 233
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 161 transition count 225
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 161 transition count 225
Free-agglomeration rule applied 112 times.
Iterating global reduction 1 with 112 rules applied. Total rules applied 144 place count 161 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (trivial) has 40 edges and 48 vertex of which 16 / 48 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 155 rules applied. Total rules applied 299 place count 40 transition count 72
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 315 place count 40 transition count 56
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 315 place count 40 transition count 48
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 331 place count 32 transition count 48
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 338 place count 32 transition count 41
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 354 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 361 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 384 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 12 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 387 place count 11 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 11 transition count 12
Applied a total of 388 rules in 12 ms. Remains 11 /169 variables (removed 158) and now considering 12/249 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 11/169 places, 12/249 transitions.
Finished random walk after 51 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=25 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) p0))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 27 factoid took 1912 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 169 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2023-03-10 22:01:43] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:43] [INFO ] Invariant cache hit.
[2023-03-10 22:01:43] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-10 22:01:43] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:43] [INFO ] Invariant cache hit.
[2023-03-10 22:01:43] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-10 22:01:43] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:43] [INFO ] Invariant cache hit.
[2023-03-10 22:01:43] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 169/169 places, 249/249 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 441 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 709 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 789908 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 789908 steps, saw 157825 distinct states, run finished after 3002 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 22:01:47] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2023-03-10 22:01:47] [INFO ] Invariant cache hit.
[2023-03-10 22:01:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-10 22:01:47] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:01:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:01:48] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:01:48] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-10 22:01:48] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 233
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 25 place count 160 transition count 224
Iterating global reduction 1 with 9 rules applied. Total rules applied 34 place count 160 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 160 transition count 223
Free-agglomeration rule applied 114 times.
Iterating global reduction 2 with 114 rules applied. Total rules applied 149 place count 160 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 79 edges and 45 vertex of which 20 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Graph (trivial) has 25 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
Iterating post reduction 2 with 165 rules applied. Total rules applied 314 place count 17 transition count 36
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 330 place count 17 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 330 place count 17 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 336 place count 14 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 338 place count 14 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 344 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 5 with 2 rules applied. Total rules applied 346 place count 10 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 347 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 349 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 6 with 6 rules applied. Total rules applied 355 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 5 transition count 5
Applied a total of 357 rules in 12 ms. Remains 5 /169 variables (removed 164) and now considering 5/249 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 5/169 places, 5/249 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 667 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 37587 reset in 414 ms.
Product exploration explored 100000 steps with 37396 reset in 421 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 168 transition count 247
Applied a total of 3 rules in 6 ms. Remains 168 /169 variables (removed 1) and now considering 247/249 (removed 2) transitions.
[2023-03-10 22:01:50] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 168 cols
[2023-03-10 22:01:50] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 22:01:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 22:01:50] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2023-03-10 22:01:50] [INFO ] Invariant cache hit.
[2023-03-10 22:01:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-10 22:01:50] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2023-03-10 22:01:50] [INFO ] Invariant cache hit.
[2023-03-10 22:01:50] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/169 places, 247/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 168/169 places, 247/249 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 13961 ms.
[2023-03-10 22:01:50] [INFO ] Flatten gal took : 20 ms
[2023-03-10 22:01:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 22:01:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 368 places, 470 transitions and 1313 arcs took 3 ms.
Total runtime 40147 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-08b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678485776744

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FlexibleBarrier-PT-08b-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 FlexibleBarrier-PT-08b-LTLFireability-01 459844 m, 91968 m/sec, 1785953 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 7/32 FlexibleBarrier-PT-08b-LTLFireability-01 861572 m, 80345 m/sec, 3497170 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 9/32 FlexibleBarrier-PT-08b-LTLFireability-01 1275810 m, 82847 m/sec, 5247439 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 12/32 FlexibleBarrier-PT-08b-LTLFireability-01 1721984 m, 89234 m/sec, 7027809 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 16/32 FlexibleBarrier-PT-08b-LTLFireability-01 2189952 m, 93593 m/sec, 8804423 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 18/32 FlexibleBarrier-PT-08b-LTLFireability-01 2577138 m, 77437 m/sec, 10517584 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 21/32 FlexibleBarrier-PT-08b-LTLFireability-01 2925214 m, 69615 m/sec, 12115970 t fired, .

Time elapsed: 35 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 23/32 FlexibleBarrier-PT-08b-LTLFireability-01 3279372 m, 70831 m/sec, 13899864 t fired, .

Time elapsed: 40 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 25/32 FlexibleBarrier-PT-08b-LTLFireability-01 3592460 m, 62617 m/sec, 15620534 t fired, .

Time elapsed: 45 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 28/32 FlexibleBarrier-PT-08b-LTLFireability-01 3943426 m, 70193 m/sec, 17201535 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 28/32 FlexibleBarrier-PT-08b-LTLFireability-01 4052642 m, 21843 m/sec, 18895222 t fired, .

Time elapsed: 55 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 31/32 FlexibleBarrier-PT-08b-LTLFireability-01 4431273 m, 75726 m/sec, 20672057 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for FlexibleBarrier-PT-08b-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FlexibleBarrier-PT-08b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-08b-LTLFireability-01: LTL unknown AGGR


Time elapsed: 65 secs. Pages in use: 32

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-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r167-tall-167838853200484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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