About the Execution of LTSMin+red for FlexibleBarrier-PT-16b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 595.943 | 51710.00 | 84201.00 | 614.90 | FFFFTFTFFT?FFFFF | normal |
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.r169-tall-167838856000547.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 ltsminxred
Input is FlexibleBarrier-PT-16b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856000547
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:25 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 26K 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 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:26 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 945K 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-16b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678566528031
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 20:28:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 20:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 20:28:50] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2023-03-11 20:28:50] [INFO ] Transformed 3472 places.
[2023-03-11 20:28:50] [INFO ] Transformed 4001 transitions.
[2023-03-11 20:28:50] [INFO ] Found NUPN structural information;
[2023-03-11 20:28:50] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1422 places :
Symmetric choice reduction at 0 with 1422 rule applications. Total rules 1422 place count 2050 transition count 2579
Iterating global reduction 0 with 1422 rules applied. Total rules applied 2844 place count 2050 transition count 2579
Discarding 665 places :
Symmetric choice reduction at 0 with 665 rule applications. Total rules 3509 place count 1385 transition count 1914
Iterating global reduction 0 with 665 rules applied. Total rules applied 4174 place count 1385 transition count 1914
Discarding 423 places :
Symmetric choice reduction at 0 with 423 rule applications. Total rules 4597 place count 962 transition count 1491
Iterating global reduction 0 with 423 rules applied. Total rules applied 5020 place count 962 transition count 1491
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 0 with 204 rules applied. Total rules applied 5224 place count 962 transition count 1287
Applied a total of 5224 rules in 781 ms. Remains 962 /3472 variables (removed 2510) and now considering 1287/4001 (removed 2714) transitions.
// Phase 1: matrix 1287 rows 962 cols
[2023-03-11 20:28:51] [INFO ] Computed 18 place invariants in 42 ms
[2023-03-11 20:28:51] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-11 20:28:51] [INFO ] Invariant cache hit.
[2023-03-11 20:28:52] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2023-03-11 20:28:52] [INFO ] Invariant cache hit.
[2023-03-11 20:28:53] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 962/3472 places, 1287/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2963 ms. Remains : 962/3472 places, 1287/4001 transitions.
Support contains 33 out of 962 places after structural reductions.
[2023-03-11 20:28:53] [INFO ] Flatten gal took : 107 ms
[2023-03-11 20:28:53] [INFO ] Flatten gal took : 66 ms
[2023-03-11 20:28:53] [INFO ] Input system was already deterministic with 1287 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 20:28:54] [INFO ] Invariant cache hit.
[2023-03-11 20:28:55] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 20:28:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-11 20:28:56] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 20:28:57] [INFO ] Deduced a trap composed of 287 places in 265 ms of which 5 ms to minimize.
[2023-03-11 20:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-11 20:28:58] [INFO ] After 2266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-11 20:28:58] [INFO ] After 3337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 9 properties in 109 ms.
Support contains 7 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Graph (trivial) has 902 edges and 962 vertex of which 97 / 962 are part of one of the 16 SCC in 4 ms
Free SCC test removed 81 places
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 881 transition count 1108
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 800 transition count 1108
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 163 place count 800 transition count 1070
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 239 place count 762 transition count 1070
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 293 place count 708 transition count 1016
Iterating global reduction 2 with 54 rules applied. Total rules applied 347 place count 708 transition count 1016
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 350 place count 708 transition count 1013
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 363 place count 695 transition count 1000
Iterating global reduction 3 with 13 rules applied. Total rules applied 376 place count 695 transition count 1000
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 389 place count 695 transition count 987
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 587 place count 596 transition count 888
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 618 place count 596 transition count 857
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 636 place count 578 transition count 839
Iterating global reduction 5 with 18 rules applied. Total rules applied 654 place count 578 transition count 839
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 657 place count 578 transition count 836
Free-agglomeration rule applied 484 times.
Iterating global reduction 6 with 484 rules applied. Total rules applied 1141 place count 578 transition count 352
Reduce places removed 484 places and 0 transitions.
Drop transitions removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 6 with 692 rules applied. Total rules applied 1833 place count 94 transition count 144
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1834 place count 94 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1835 place count 93 transition count 143
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 81 edges and 92 vertex of which 32 / 92 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 1838 place count 76 transition count 142
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 1871 place count 75 transition count 110
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 1871 place count 75 transition count 95
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1901 place count 60 transition count 95
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1916 place count 60 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 1948 place count 44 transition count 64
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1949 place count 44 transition count 63
Free-agglomeration rule applied 17 times.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1966 place count 44 transition count 46
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 55 rules applied. Total rules applied 2021 place count 15 transition count 20
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2024 place count 15 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2026 place count 15 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2028 place count 13 transition count 15
Applied a total of 2028 rules in 519 ms. Remains 13 /962 variables (removed 949) and now considering 15/1287 (removed 1272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 13/962 places, 15/1287 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=21 )
Computed a total of 19 stabilizing places and 19 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((X((p1&&G(p2)))||p0)))'
Support contains 9 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 941 transition count 1266
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 941 transition count 1266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 941 transition count 1264
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 924 transition count 1247
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 924 transition count 1247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 924 transition count 1237
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 922 transition count 1235
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 922 transition count 1235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 922 transition count 1234
Applied a total of 93 rules in 100 ms. Remains 922 /962 variables (removed 40) and now considering 1234/1287 (removed 53) transitions.
// Phase 1: matrix 1234 rows 922 cols
[2023-03-11 20:28:59] [INFO ] Computed 18 place invariants in 16 ms
[2023-03-11 20:29:00] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-11 20:29:00] [INFO ] Invariant cache hit.
[2023-03-11 20:29:01] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2023-03-11 20:29:01] [INFO ] Invariant cache hit.
[2023-03-11 20:29:01] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 922/962 places, 1234/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2037 ms. Remains : 922/962 places, 1234/1287 transitions.
Stuttering acceptance computed with spot in 477 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s188 0) (EQ s63 1)) (AND (EQ s721 0) (EQ s33 1))), p2:(AND (OR (EQ s715 0) (EQ s397 1)) (OR (EQ s878 0) (EQ s883 1))), p1:(EQ s368 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 892 reset in 405 ms.
Entered a terminal (fully accepting) state of product in 26365 steps with 233 reset in 82 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-00 finished in 3080 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((X(p0)||G(p1))))'
Support contains 3 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 935 transition count 1260
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 935 transition count 1260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 935 transition count 1258
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 912 transition count 1235
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 912 transition count 1235
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 119 place count 912 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 911 transition count 1217
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 911 transition count 1217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 911 transition count 1216
Applied a total of 122 rules in 111 ms. Remains 911 /962 variables (removed 51) and now considering 1216/1287 (removed 71) transitions.
// Phase 1: matrix 1216 rows 911 cols
[2023-03-11 20:29:02] [INFO ] Computed 18 place invariants in 23 ms
[2023-03-11 20:29:03] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-11 20:29:03] [INFO ] Invariant cache hit.
[2023-03-11 20:29:04] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-11 20:29:04] [INFO ] Invariant cache hit.
[2023-03-11 20:29:04] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/962 places, 1216/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1928 ms. Remains : 911/962 places, 1216/1287 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s885 0) (EQ s860 1)), p0:(EQ s445 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46615 steps with 416 reset in 116 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-03 finished in 2270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 936 transition count 1261
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 936 transition count 1261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 936 transition count 1258
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 76 place count 915 transition count 1237
Iterating global reduction 1 with 21 rules applied. Total rules applied 97 place count 915 transition count 1237
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 111 place count 915 transition count 1223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 913 transition count 1221
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 913 transition count 1221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 913 transition count 1220
Applied a total of 116 rules in 81 ms. Remains 913 /962 variables (removed 49) and now considering 1220/1287 (removed 67) transitions.
// Phase 1: matrix 1220 rows 913 cols
[2023-03-11 20:29:05] [INFO ] Computed 18 place invariants in 20 ms
[2023-03-11 20:29:05] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-11 20:29:05] [INFO ] Invariant cache hit.
[2023-03-11 20:29:06] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2023-03-11 20:29:06] [INFO ] Invariant cache hit.
[2023-03-11 20:29:06] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 913/962 places, 1220/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 913/962 places, 1220/1287 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s785 0) (EQ s793 1)) (AND (EQ s884 0) (EQ s731 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-05 finished in 1815 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)))'
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 934 transition count 1259
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 934 transition count 1259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 934 transition count 1256
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 83 place count 910 transition count 1232
Iterating global reduction 1 with 24 rules applied. Total rules applied 107 place count 910 transition count 1232
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 124 place count 910 transition count 1215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 908 transition count 1213
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 908 transition count 1213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 908 transition count 1212
Applied a total of 129 rules in 80 ms. Remains 908 /962 variables (removed 54) and now considering 1212/1287 (removed 75) transitions.
// Phase 1: matrix 1212 rows 908 cols
[2023-03-11 20:29:06] [INFO ] Computed 18 place invariants in 20 ms
[2023-03-11 20:29:07] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-11 20:29:07] [INFO ] Invariant cache hit.
[2023-03-11 20:29:08] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2023-03-11 20:29:08] [INFO ] Invariant cache hit.
[2023-03-11 20:29:08] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/962 places, 1212/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1684 ms. Remains : 908/962 places, 1212/1287 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s569 0) (EQ s765 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 795 ms.
Product exploration explored 100000 steps with 50000 reset in 772 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-06 finished in 3450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1))) U (!p2&&G((p0||X(p1)))))))'
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 936 transition count 1261
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 936 transition count 1261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 936 transition count 1258
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 914 transition count 1236
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 914 transition count 1236
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 114 place count 914 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 913 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 913 transition count 1220
Applied a total of 116 rules in 71 ms. Remains 913 /962 variables (removed 49) and now considering 1220/1287 (removed 67) transitions.
// Phase 1: matrix 1220 rows 913 cols
[2023-03-11 20:29:10] [INFO ] Computed 18 place invariants in 20 ms
[2023-03-11 20:29:10] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 20:29:10] [INFO ] Invariant cache hit.
[2023-03-11 20:29:11] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-11 20:29:11] [INFO ] Invariant cache hit.
[2023-03-11 20:29:11] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 913/962 places, 1220/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1665 ms. Remains : 913/962 places, 1220/1287 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s404 0) (EQ s517 1)), p0:(EQ s77 1), p1:(EQ s391 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-07 finished in 1942 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Graph (trivial) has 907 edges and 962 vertex of which 97 / 962 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 880 transition count 1119
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 795 transition count 1119
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 171 place count 795 transition count 1083
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 243 place count 759 transition count 1083
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 298 place count 704 transition count 1028
Iterating global reduction 2 with 55 rules applied. Total rules applied 353 place count 704 transition count 1028
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 704 transition count 1025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 356 place count 704 transition count 1024
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 358 place count 703 transition count 1024
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 371 place count 690 transition count 1011
Iterating global reduction 3 with 13 rules applied. Total rules applied 384 place count 690 transition count 1011
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 396 place count 690 transition count 999
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 590 place count 593 transition count 902
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 593 place count 590 transition count 899
Iterating global reduction 4 with 3 rules applied. Total rules applied 596 place count 590 transition count 899
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 599 place count 590 transition count 896
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 615 place count 590 transition count 880
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 617 place count 588 transition count 878
Applied a total of 617 rules in 359 ms. Remains 588 /962 variables (removed 374) and now considering 878/1287 (removed 409) transitions.
[2023-03-11 20:29:12] [INFO ] Flow matrix only has 847 transitions (discarded 31 similar events)
// Phase 1: matrix 847 rows 588 cols
[2023-03-11 20:29:12] [INFO ] Computed 18 place invariants in 21 ms
[2023-03-11 20:29:12] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-11 20:29:12] [INFO ] Flow matrix only has 847 transitions (discarded 31 similar events)
[2023-03-11 20:29:12] [INFO ] Invariant cache hit.
[2023-03-11 20:29:13] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2023-03-11 20:29:13] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-11 20:29:13] [INFO ] Flow matrix only has 847 transitions (discarded 31 similar events)
[2023-03-11 20:29:13] [INFO ] Invariant cache hit.
[2023-03-11 20:29:13] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/962 places, 878/1287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1708 ms. Remains : 588/962 places, 878/1287 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s66 0) (EQ s307 1)), p0:(OR (EQ s427 0) (EQ s148 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-16b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-08 finished in 1861 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((X(F(p0))||(p1&&G(p2)))))'
Support contains 5 out of 962 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Graph (trivial) has 906 edges and 962 vertex of which 97 / 962 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 880 transition count 1120
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 796 transition count 1120
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 169 place count 796 transition count 1084
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 241 place count 760 transition count 1084
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 297 place count 704 transition count 1028
Iterating global reduction 2 with 56 rules applied. Total rules applied 353 place count 704 transition count 1028
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 704 transition count 1025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 356 place count 704 transition count 1024
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 358 place count 703 transition count 1024
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 372 place count 689 transition count 1010
Iterating global reduction 3 with 14 rules applied. Total rules applied 386 place count 689 transition count 1010
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 399 place count 689 transition count 997
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 593 place count 592 transition count 900
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 597 place count 588 transition count 896
Iterating global reduction 4 with 4 rules applied. Total rules applied 601 place count 588 transition count 896
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 605 place count 588 transition count 892
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 621 place count 588 transition count 876
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 623 place count 586 transition count 874
Applied a total of 623 rules in 289 ms. Remains 586 /962 variables (removed 376) and now considering 874/1287 (removed 413) transitions.
[2023-03-11 20:29:14] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
// Phase 1: matrix 843 rows 586 cols
[2023-03-11 20:29:14] [INFO ] Computed 18 place invariants in 19 ms
[2023-03-11 20:29:14] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-11 20:29:14] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:14] [INFO ] Invariant cache hit.
[2023-03-11 20:29:15] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-11 20:29:15] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-11 20:29:15] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:15] [INFO ] Invariant cache hit.
[2023-03-11 20:29:15] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/962 places, 874/1287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1488 ms. Remains : 586/962 places, 874/1287 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s549 1), p2:(OR (EQ s133 0) (EQ s286 1)), p0:(OR (EQ s89 0) (EQ s420 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 33397 reset in 1917 ms.
Product exploration explored 100000 steps with 33445 reset in 1766 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 460 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 485972 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485972 steps, saw 118596 distinct states, run finished after 3004 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 20:29:22] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:22] [INFO ] Invariant cache hit.
[2023-03-11 20:29:22] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-11 20:29:23] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 20:29:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-11 20:29:23] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 20:29:23] [INFO ] Deduced a trap composed of 246 places in 163 ms of which 1 ms to minimize.
[2023-03-11 20:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-11 20:29:23] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 20:29:23] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 874/874 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 586 transition count 842
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 570 transition count 826
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 570 transition count 826
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 546 place count 570 transition count 344
Reduce places removed 483 places and 0 transitions.
Drop transitions removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (trivial) has 79 edges and 87 vertex of which 32 / 87 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 692 rules applied. Total rules applied 1238 place count 71 transition count 136
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1270 place count 71 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1270 place count 71 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1300 place count 56 transition count 89
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1315 place count 56 transition count 74
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1347 place count 40 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1348 place count 40 transition count 57
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1364 place count 40 transition count 41
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 1420 place count 11 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1422 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1423 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1424 place count 10 transition count 11
Applied a total of 1424 rules in 79 ms. Remains 10 /586 variables (removed 576) and now considering 11/874 (removed 863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 10/586 places, 11/874 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 353 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 66 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-11 20:29:24] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:24] [INFO ] Invariant cache hit.
[2023-03-11 20:29:24] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-11 20:29:24] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:24] [INFO ] Invariant cache hit.
[2023-03-11 20:29:25] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2023-03-11 20:29:25] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-11 20:29:25] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:25] [INFO ] Invariant cache hit.
[2023-03-11 20:29:25] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1487 ms. Remains : 586/586 places, 874/874 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 473165 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473165 steps, saw 114991 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 20:29:29] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:29] [INFO ] Invariant cache hit.
[2023-03-11 20:29:29] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-11 20:29:29] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 20:29:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-11 20:29:29] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 20:29:30] [INFO ] Deduced a trap composed of 246 places in 184 ms of which 2 ms to minimize.
[2023-03-11 20:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-11 20:29:30] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-11 20:29:30] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 874/874 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 586 transition count 842
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 570 transition count 826
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 570 transition count 826
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 546 place count 570 transition count 344
Reduce places removed 483 places and 0 transitions.
Drop transitions removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (trivial) has 79 edges and 87 vertex of which 32 / 87 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 692 rules applied. Total rules applied 1238 place count 71 transition count 136
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1270 place count 71 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1270 place count 71 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1300 place count 56 transition count 89
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1315 place count 56 transition count 74
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1347 place count 40 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1348 place count 40 transition count 57
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1364 place count 40 transition count 41
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 1420 place count 11 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1422 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1423 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1424 place count 10 transition count 11
Applied a total of 1424 rules in 69 ms. Remains 10 /586 variables (removed 576) and now considering 11/874 (removed 863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 10/586 places, 11/874 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33367 reset in 1788 ms.
Product exploration explored 100000 steps with 33416 reset in 1714 ms.
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 35 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2023-03-11 20:29:34] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:34] [INFO ] Invariant cache hit.
[2023-03-11 20:29:34] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-11 20:29:34] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:34] [INFO ] Invariant cache hit.
[2023-03-11 20:29:35] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-11 20:29:35] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 20:29:35] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:29:35] [INFO ] Invariant cache hit.
[2023-03-11 20:29:35] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1238 ms. Remains : 586/586 places, 874/874 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-10 finished in 21778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 1287/1287 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 934 transition count 1259
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 934 transition count 1259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 934 transition count 1257
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 910 transition count 1233
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 910 transition count 1233
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 122 place count 910 transition count 1217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 908 transition count 1215
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 908 transition count 1215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 908 transition count 1214
Applied a total of 127 rules in 149 ms. Remains 908 /962 variables (removed 54) and now considering 1214/1287 (removed 73) transitions.
// Phase 1: matrix 1214 rows 908 cols
[2023-03-11 20:29:36] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-11 20:29:36] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-11 20:29:36] [INFO ] Invariant cache hit.
[2023-03-11 20:29:37] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-11 20:29:37] [INFO ] Invariant cache hit.
[2023-03-11 20:29:37] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/962 places, 1214/1287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1783 ms. Remains : 908/962 places, 1214/1287 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s70 0) (EQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4172 steps with 36 reset in 9 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-13 finished in 1966 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((X(F(p0))||(p1&&G(p2)))))'
[2023-03-11 20:29:38] [INFO ] Flatten gal took : 53 ms
[2023-03-11 20:29:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 20:29:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 962 places, 1287 transitions and 3799 arcs took 10 ms.
Total runtime 48419 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/878/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-16b-LTLCardinality-10
BK_STOP 1678566579741
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
ltl formula name FlexibleBarrier-PT-16b-LTLCardinality-10
ltl formula formula --ltl=/tmp/878/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 962 places, 1287 transitions and 3799 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.030 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/878/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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-16b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-16b, 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 r169-tall-167838856000547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 '
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 ;