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-167838853200483.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853200483
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678485641958

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=LTLCardinality
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:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 22:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:00:43] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-10 22:00:43] [INFO ] Transformed 920 places.
[2023-03-10 22:00:43] [INFO ] Transformed 1057 transitions.
[2023-03-10 22:00:43] [INFO ] Found NUPN structural information;
[2023-03-10 22:00:43] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 336 place count 584 transition count 721
Iterating global reduction 0 with 336 rules applied. Total rules applied 672 place count 584 transition count 721
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 811 place count 445 transition count 582
Iterating global reduction 0 with 139 rules applied. Total rules applied 950 place count 445 transition count 582
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 1034 place count 361 transition count 498
Iterating global reduction 0 with 84 rules applied. Total rules applied 1118 place count 361 transition count 498
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 1156 place count 361 transition count 460
Applied a total of 1156 rules in 221 ms. Remains 361 /920 variables (removed 559) and now considering 460/1057 (removed 597) transitions.
// Phase 1: matrix 460 rows 361 cols
[2023-03-10 22:00:44] [INFO ] Computed 10 place invariants in 45 ms
[2023-03-10 22:00:44] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-10 22:00:44] [INFO ] Invariant cache hit.
[2023-03-10 22:00:44] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-10 22:00:44] [INFO ] Invariant cache hit.
[2023-03-10 22:00:44] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/920 places, 460/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1235 ms. Remains : 361/920 places, 460/1057 transitions.
Support contains 21 out of 361 places after structural reductions.
[2023-03-10 22:00:45] [INFO ] Flatten gal took : 58 ms
[2023-03-10 22:00:45] [INFO ] Flatten gal took : 23 ms
[2023-03-10 22:00:45] [INFO ] Input system was already deterministic with 460 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 22:00:46] [INFO ] Invariant cache hit.
[2023-03-10 22:00:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:00:46] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 22:00:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:00:46] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 22:00:46] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 4 ms to minimize.
[2023-03-10 22:00:46] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2023-03-10 22:00:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-10 22:00:46] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-10 22:00:46] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 12 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 329 edges and 361 vertex of which 49 / 361 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 320 transition count 374
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 284 transition count 374
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 73 place count 284 transition count 351
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 119 place count 261 transition count 351
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 146 place count 234 transition count 324
Iterating global reduction 2 with 27 rules applied. Total rules applied 173 place count 234 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 234 transition count 323
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 183 place count 225 transition count 314
Iterating global reduction 3 with 9 rules applied. Total rules applied 192 place count 225 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 200 place count 225 transition count 306
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 304 place count 173 transition count 254
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 320 place count 173 transition count 238
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 328 place count 165 transition count 230
Iterating global reduction 5 with 8 rules applied. Total rules applied 336 place count 165 transition count 230
Free-agglomeration rule applied 116 times.
Iterating global reduction 5 with 116 rules applied. Total rules applied 452 place count 165 transition count 114
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 132 edges and 49 vertex of which 34 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 164 rules applied. Total rules applied 616 place count 34 transition count 67
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 637 place count 34 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 638 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 10 / 32 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 640 place count 27 transition count 45
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 650 place count 27 transition count 35
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 650 place count 27 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 660 place count 22 transition count 30
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 665 place count 22 transition count 25
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 10 with 10 rules applied. Total rules applied 675 place count 17 transition count 20
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 680 place count 17 transition count 15
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 693 place count 9 transition count 10
Applied a total of 693 rules in 87 ms. Remains 9 /361 variables (removed 352) and now considering 10/460 (removed 450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 9/361 places, 10/460 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
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' '!(X(!(!p0 U (X(p0)||p1))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 346 transition count 445
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 346 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 346 transition count 444
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 334 transition count 432
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 334 transition count 424
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 332 transition count 422
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 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 68 place count 332 transition count 421
Applied a total of 68 rules in 33 ms. Remains 332 /361 variables (removed 29) and now considering 421/460 (removed 39) transitions.
// Phase 1: matrix 421 rows 332 cols
[2023-03-10 22:00:47] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-10 22:00:47] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 22:00:47] [INFO ] Invariant cache hit.
[2023-03-10 22:00:47] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-10 22:00:47] [INFO ] Invariant cache hit.
[2023-03-10 22:00:47] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/361 places, 421/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 332/361 places, 421/460 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR p1 p0), (OR p1 p0), true, p0]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (EQ s163 0) (EQ s129 1)), p1:(OR (EQ s111 1) (EQ s163 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-02 finished in 810 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)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 331 edges and 361 vertex of which 49 / 361 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 319 transition count 379
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 281 transition count 379
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 77 place count 281 transition count 357
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 121 place count 259 transition count 357
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 151 place count 229 transition count 327
Iterating global reduction 2 with 30 rules applied. Total rules applied 181 place count 229 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 229 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 182 place count 229 transition count 325
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 184 place count 228 transition count 325
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 193 place count 219 transition count 316
Iterating global reduction 3 with 9 rules applied. Total rules applied 202 place count 219 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 210 place count 219 transition count 308
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 306 place count 171 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 170 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 170 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 170 transition count 258
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 170 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 168 transition count 248
Applied a total of 319 rules in 96 ms. Remains 168 /361 variables (removed 193) and now considering 248/460 (removed 212) transitions.
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
// Phase 1: matrix 233 rows 168 cols
[2023-03-10 22:00:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:00:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2023-03-10 22:00:48] [INFO ] Invariant cache hit.
[2023-03-10 22:00:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-10 22:00:48] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2023-03-10 22:00:48] [INFO ] Invariant cache hit.
[2023-03-10 22:00:48] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/361 places, 248/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 168/361 places, 248/460 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s14 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-03 finished in 506 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 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 332 edges and 361 vertex of which 49 / 361 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 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 319 transition count 378
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 280 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 79 place count 280 transition count 357
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 259 transition count 357
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 149 place count 231 transition count 329
Iterating global reduction 2 with 28 rules applied. Total rules applied 177 place count 231 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 177 place count 231 transition count 328
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 230 transition count 328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 222 transition count 320
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 222 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 201 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 3 with 98 rules applied. Total rules applied 299 place count 173 transition count 265
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 301 place count 171 transition count 263
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 171 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 305 place count 171 transition count 261
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 313 place count 171 transition count 253
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 169 transition count 251
Applied a total of 315 rules in 68 ms. Remains 169 /361 variables (removed 192) and now considering 251/460 (removed 209) transitions.
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
// Phase 1: matrix 236 rows 169 cols
[2023-03-10 22:00:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:00:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2023-03-10 22:00:48] [INFO ] Invariant cache hit.
[2023-03-10 22:00:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-10 22:00:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 22:00:48] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2023-03-10 22:00:48] [INFO ] Invariant cache hit.
[2023-03-10 22:00:48] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/361 places, 251/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 169/361 places, 251/460 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-06 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 s42 1), p1:(AND (EQ s72 0) (EQ s61 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-06 finished in 546 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((F(p0)&&X(G(p1)))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 331 edges and 361 vertex of which 49 / 361 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 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 319 transition count 378
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 280 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 79 place count 280 transition count 357
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 259 transition count 357
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 149 place count 231 transition count 329
Iterating global reduction 2 with 28 rules applied. Total rules applied 177 place count 231 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 231 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 178 place count 231 transition count 327
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 230 transition count 327
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 188 place count 222 transition count 319
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 222 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 203 place count 222 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 303 place count 172 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 311 place count 172 transition count 254
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 313 place count 170 transition count 252
Applied a total of 313 rules in 58 ms. Remains 170 /361 variables (removed 191) and now considering 252/460 (removed 208) transitions.
[2023-03-10 22:00:49] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
// Phase 1: matrix 237 rows 170 cols
[2023-03-10 22:00:49] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:00:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 22:00:49] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2023-03-10 22:00:49] [INFO ] Invariant cache hit.
[2023-03-10 22:00:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-10 22:00:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 22:00:49] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2023-03-10 22:00:49] [INFO ] Invariant cache hit.
[2023-03-10 22:00:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/361 places, 252/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 397 ms. Remains : 170/361 places, 252/460 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s157 0) (EQ s128 1)), p1:(OR (EQ s0 0) (EQ s91 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 57099 steps with 3899 reset in 360 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-07 finished in 897 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((X(p1)||p0))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 348 transition count 447
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 348 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 348 transition count 446
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 38 place count 337 transition count 435
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 337 transition count 435
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 337 transition count 429
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 334 transition count 426
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 334 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 334 transition count 424
Applied a total of 63 rules in 42 ms. Remains 334 /361 variables (removed 27) and now considering 424/460 (removed 36) transitions.
// Phase 1: matrix 424 rows 334 cols
[2023-03-10 22:00:50] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:00:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 22:00:50] [INFO ] Invariant cache hit.
[2023-03-10 22:00:50] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-10 22:00:50] [INFO ] Invariant cache hit.
[2023-03-10 22:00:50] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/361 places, 424/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 334/361 places, 424/460 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s327 0) (NEQ s300 1)), p0:(OR (EQ s12 1) (EQ s327 0) (EQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5029 steps with 75 reset in 16 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-10 finished in 767 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(!p0) U X(X(G(p1))))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 348 transition count 447
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 348 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 348 transition count 446
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 338 transition count 436
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 338 transition count 436
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 336 transition count 427
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 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 60 place count 336 transition count 425
Applied a total of 60 rules in 21 ms. Remains 336 /361 variables (removed 25) and now considering 425/460 (removed 35) transitions.
// Phase 1: matrix 425 rows 336 cols
[2023-03-10 22:00:50] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-10 22:00:50] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-10 22:00:50] [INFO ] Invariant cache hit.
[2023-03-10 22:00:51] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-10 22:00:51] [INFO ] Invariant cache hit.
[2023-03-10 22:00:51] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/361 places, 425/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 336/361 places, 425/460 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s281 0) (EQ s276 1)), p1:(OR (EQ s196 0) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20017 reset in 249 ms.
Product exploration explored 100000 steps with 19925 reset in 233 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:00:52] [INFO ] Invariant cache hit.
[2023-03-10 22:00:52] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:00:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:00:52] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:00:52] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2023-03-10 22:00:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-10 22:00:52] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 22:00:52] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 425/425 transitions.
Graph (trivial) has 306 edges and 336 vertex of which 49 / 336 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 295 transition count 338
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 258 transition count 338
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 75 place count 258 transition count 319
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 113 place count 239 transition count 319
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 129 place count 223 transition count 303
Iterating global reduction 2 with 16 rules applied. Total rules applied 145 place count 223 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 222 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 222 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 222 transition count 301
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 3 with 106 rules applied. Total rules applied 254 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 270 place count 169 transition count 232
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 278 place count 161 transition count 224
Iterating global reduction 4 with 8 rules applied. Total rules applied 286 place count 161 transition count 224
Free-agglomeration rule applied 114 times.
Iterating global reduction 4 with 114 rules applied. Total rules applied 400 place count 161 transition count 110
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 124 edges and 47 vertex of which 22 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 162 rules applied. Total rules applied 562 place count 22 transition count 63
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 597 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 598 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 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 6 with 2 rules applied. Total rules applied 600 place count 17 transition count 27
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 606 place count 17 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 606 place count 17 transition count 18
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 612 place count 14 transition count 18
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 615 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 9 with 6 rules applied. Total rules applied 621 place count 11 transition count 12
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 624 place count 11 transition count 9
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 633 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 635 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 637 place count 3 transition count 4
Applied a total of 637 rules in 35 ms. Remains 3 /336 variables (removed 333) and now considering 4/425 (removed 421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 3/336 places, 4/425 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 425/425 transitions.
Applied a total of 0 rules in 8 ms. Remains 336 /336 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2023-03-10 22:00:53] [INFO ] Invariant cache hit.
[2023-03-10 22:00:53] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 22:00:53] [INFO ] Invariant cache hit.
[2023-03-10 22:00:53] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-10 22:00:53] [INFO ] Invariant cache hit.
[2023-03-10 22:00:54] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 336/336 places, 425/425 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Finished random walk after 6645 steps, including 98 resets, run visited all 3 properties in 86 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 19970 reset in 189 ms.
Product exploration explored 100000 steps with 19983 reset in 195 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 425/425 transitions.
Graph (trivial) has 304 edges and 336 vertex of which 49 / 336 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.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 295 transition count 383
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 32 place count 295 transition count 383
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 295 transition count 383
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 90 place count 259 transition count 347
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 126 place count 259 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 258 transition count 346
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 258 transition count 346
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 174 place count 258 transition count 362
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 194 place count 238 transition count 342
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 214 place count 238 transition count 342
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 222 place count 238 transition count 358
Deduced a syphon composed of 66 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 238 place count 238 transition count 342
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 238 rules in 70 ms. Remains 238 /336 variables (removed 98) and now considering 342/425 (removed 83) transitions.
[2023-03-10 22:00:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 22:00:56] [INFO ] Flow matrix only has 327 transitions (discarded 15 similar events)
// Phase 1: matrix 327 rows 238 cols
[2023-03-10 22:00:56] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:00:56] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/336 places, 342/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 238/336 places, 342/425 transitions.
Support contains 4 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 425/425 transitions.
Applied a total of 0 rules in 6 ms. Remains 336 /336 variables (removed 0) and now considering 425/425 (removed 0) transitions.
// Phase 1: matrix 425 rows 336 cols
[2023-03-10 22:00:56] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:00:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 22:00:56] [INFO ] Invariant cache hit.
[2023-03-10 22:00:56] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-10 22:00:56] [INFO ] Invariant cache hit.
[2023-03-10 22:00:57] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 336/336 places, 425/425 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-11 finished in 6402 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)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 332 edges and 361 vertex of which 49 / 361 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 319 transition count 379
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 281 transition count 379
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 77 place count 281 transition count 357
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 121 place count 259 transition count 357
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 150 place count 230 transition count 328
Iterating global reduction 2 with 29 rules applied. Total rules applied 179 place count 230 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 230 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 180 place count 230 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 182 place count 229 transition count 326
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 190 place count 221 transition count 318
Iterating global reduction 3 with 8 rules applied. Total rules applied 198 place count 221 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 205 place count 221 transition count 311
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 303 place count 172 transition count 262
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 170 transition count 260
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 170 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 309 place count 170 transition count 258
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 170 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 168 transition count 248
Applied a total of 319 rules in 53 ms. Remains 168 /361 variables (removed 193) and now considering 248/460 (removed 212) transitions.
[2023-03-10 22:00:57] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
// Phase 1: matrix 233 rows 168 cols
[2023-03-10 22:00:57] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:00:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 22:00:57] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2023-03-10 22:00:57] [INFO ] Invariant cache hit.
[2023-03-10 22:00:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-10 22:00:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:00:57] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2023-03-10 22:00:57] [INFO ] Invariant cache hit.
[2023-03-10 22:00:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/361 places, 248/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 168/361 places, 248/460 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s135 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6829 reset in 296 ms.
Stuttering criterion allowed to conclude after 29588 steps with 2031 reset in 102 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-15 finished in 858 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(!p0) U X(X(G(p1))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-08b-LTLCardinality-11
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 361/361 places, 460/460 transitions.
Graph (trivial) has 329 edges and 361 vertex of which 49 / 361 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 319 transition count 381
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 283 transition count 381
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 73 place count 283 transition count 359
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 117 place count 261 transition count 359
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 145 place count 233 transition count 331
Iterating global reduction 2 with 28 rules applied. Total rules applied 173 place count 233 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 233 transition count 330
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 183 place count 224 transition count 321
Iterating global reduction 3 with 9 rules applied. Total rules applied 192 place count 224 transition count 321
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 200 place count 224 transition count 313
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 300 place count 174 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 301 place count 173 transition count 262
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 173 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 173 transition count 261
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 311 place count 173 transition count 253
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 313 place count 171 transition count 251
Applied a total of 313 rules in 42 ms. Remains 171 /361 variables (removed 190) and now considering 251/460 (removed 209) transitions.
[2023-03-10 22:00:58] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
// Phase 1: matrix 236 rows 171 cols
[2023-03-10 22:00:58] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 22:00:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-10 22:00:58] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2023-03-10 22:00:58] [INFO ] Invariant cache hit.
[2023-03-10 22:00:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-10 22:00:58] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
[2023-03-10 22:00:58] [INFO ] Invariant cache hit.
[2023-03-10 22:00:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 171/361 places, 251/460 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 329 ms. Remains : 171/361 places, 251/460 transitions.
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s120 0) (EQ s116 1)), p1:(OR (EQ s83 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36612 steps with 7352 reset in 170 ms.
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-11 finished in 818 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-10 22:00:58] [INFO ] Flatten gal took : 19 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 15416 ms.
ITS solved all properties within timeout

BK_STOP 1678485659975

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853200483"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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