Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976600332.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976600332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 614K Mar 5 18:23 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 ShieldRVt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679246096753

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:14:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:14:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:14:58] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-19 17:14:58] [INFO ] Transformed 2503 places.
[2023-03-19 17:14:58] [INFO ] Transformed 2503 transitions.
[2023-03-19 17:14:58] [INFO ] Found NUPN structural information;
[2023-03-19 17:14:58] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-050B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 538 place count 1965 transition count 1965
Iterating global reduction 0 with 538 rules applied. Total rules applied 1076 place count 1965 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 1964 transition count 1964
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 1964 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1079 place count 1963 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 1080 place count 1963 transition count 1963
Applied a total of 1080 rules in 722 ms. Remains 1963 /2503 variables (removed 540) and now considering 1963/2503 (removed 540) transitions.
// Phase 1: matrix 1963 rows 1963 cols
[2023-03-19 17:14:59] [INFO ] Computed 201 place invariants in 53 ms
[2023-03-19 17:15:00] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-19 17:15:00] [INFO ] Invariant cache hit.
[2023-03-19 17:15:02] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
[2023-03-19 17:15:02] [INFO ] Invariant cache hit.
[2023-03-19 17:15:03] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1963/2503 places, 1963/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3998 ms. Remains : 1963/2503 places, 1963/2503 transitions.
Support contains 39 out of 1963 places after structural reductions.
[2023-03-19 17:15:03] [INFO ] Flatten gal took : 118 ms
[2023-03-19 17:15:03] [INFO ] Flatten gal took : 67 ms
[2023-03-19 17:15:03] [INFO ] Input system was already deterministic with 1963 transitions.
Support contains 37 out of 1963 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-19 17:15:04] [INFO ] Invariant cache hit.
[2023-03-19 17:15:05] [INFO ] [Real]Absence check using 201 positive place invariants in 85 ms returned sat
[2023-03-19 17:15:05] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-19 17:15:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 55 ms returned sat
[2023-03-19 17:15:10] [INFO ] After 3596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-19 17:15:10] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 8 ms to minimize.
[2023-03-19 17:15:11] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 1 ms to minimize.
[2023-03-19 17:15:11] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 1 ms to minimize.
[2023-03-19 17:15:11] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 3 ms to minimize.
[2023-03-19 17:15:12] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 1 ms to minimize.
[2023-03-19 17:15:12] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Deduced a trap composed of 59 places in 280 ms of which 1 ms to minimize.
[2023-03-19 17:15:14] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 1 ms to minimize.
[2023-03-19 17:15:14] [INFO ] Deduced a trap composed of 79 places in 257 ms of which 1 ms to minimize.
[2023-03-19 17:15:14] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 1 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 68 places in 221 ms of which 3 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 1 ms to minimize.
[2023-03-19 17:15:16] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:15:16] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 1 ms to minimize.
[2023-03-19 17:15:16] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 1 ms to minimize.
[2023-03-19 17:15:17] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 1 ms to minimize.
[2023-03-19 17:15:17] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 1 ms to minimize.
[2023-03-19 17:15:17] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 2 ms to minimize.
[2023-03-19 17:15:18] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:15:18] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8062 ms
[2023-03-19 17:15:19] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2023-03-19 17:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 524 ms
[2023-03-19 17:15:20] [INFO ] Deduced a trap composed of 60 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:15:20] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 2 ms to minimize.
[2023-03-19 17:15:20] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 1 ms to minimize.
[2023-03-19 17:15:21] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 1 ms to minimize.
[2023-03-19 17:15:21] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 1 ms to minimize.
[2023-03-19 17:15:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1947 ms
[2023-03-19 17:15:22] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 1 ms to minimize.
[2023-03-19 17:15:22] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 1 ms to minimize.
[2023-03-19 17:15:23] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 1 ms to minimize.
[2023-03-19 17:15:23] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 1 ms to minimize.
[2023-03-19 17:15:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1697 ms
[2023-03-19 17:15:24] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 1 ms to minimize.
[2023-03-19 17:15:24] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 3 ms to minimize.
[2023-03-19 17:15:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2023-03-19 17:15:25] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 1 ms to minimize.
[2023-03-19 17:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-19 17:15:26] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 1 ms to minimize.
[2023-03-19 17:15:26] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 1 ms to minimize.
[2023-03-19 17:15:27] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 0 ms to minimize.
[2023-03-19 17:15:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1223 ms
[2023-03-19 17:15:28] [INFO ] Deduced a trap composed of 66 places in 303 ms of which 1 ms to minimize.
[2023-03-19 17:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2023-03-19 17:15:28] [INFO ] After 22158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1841 ms.
[2023-03-19 17:15:30] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 1022 ms.
Support contains 27 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Drop transitions removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 531 rules applied. Total rules applied 531 place count 1963 transition count 1432
Reduce places removed 531 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 534 rules applied. Total rules applied 1065 place count 1432 transition count 1429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1068 place count 1429 transition count 1429
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1068 place count 1429 transition count 1042
Deduced a syphon composed of 387 places in 2 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1842 place count 1042 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1844 place count 1040 transition count 1040
Iterating global reduction 3 with 2 rules applied. Total rules applied 1846 place count 1040 transition count 1040
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1846 place count 1040 transition count 1038
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1850 place count 1038 transition count 1038
Performed 456 Post agglomeration using F-continuation condition.Transition count delta: 456
Deduced a syphon composed of 456 places in 0 ms
Reduce places removed 456 places and 0 transitions.
Iterating global reduction 3 with 912 rules applied. Total rules applied 2762 place count 582 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2763 place count 582 transition count 581
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 581 transition count 580
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2967 place count 480 transition count 672
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 3049 place count 439 transition count 710
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3050 place count 439 transition count 709
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3052 place count 439 transition count 707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3054 place count 437 transition count 707
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3056 place count 437 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3057 place count 436 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3058 place count 435 transition count 704
Applied a total of 3058 rules in 387 ms. Remains 435 /1963 variables (removed 1528) and now considering 704/1963 (removed 1259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 435/1963 places, 704/1963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 704 rows 435 cols
[2023-03-19 17:15:32] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-19 17:15:32] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned sat
[2023-03-19 17:15:32] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 17:15:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-19 17:15:33] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 17:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:15:33] [INFO ] After 252ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-19 17:15:33] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-19 17:15:34] [INFO ] After 1606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 292 ms.
Support contains 19 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 704/704 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 434 transition count 703
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 434 transition count 699
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 430 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 429 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 429 transition count 698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 429 transition count 697
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 428 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 427 transition count 696
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 425 transition count 699
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 425 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 424 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 424 transition count 698
Applied a total of 23 rules in 73 ms. Remains 424 /435 variables (removed 11) and now considering 698/704 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 424/435 places, 698/704 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 122970 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122970 steps, saw 84263 distinct states, run finished after 3010 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 698 rows 424 cols
[2023-03-19 17:15:38] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:15:38] [INFO ] [Real]Absence check using 200 positive place invariants in 17 ms returned sat
[2023-03-19 17:15:38] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 17:15:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 18 ms returned sat
[2023-03-19 17:15:38] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 17:15:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:15:39] [INFO ] After 222ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 17:15:39] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-19 17:15:39] [INFO ] After 1248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 291 ms.
Support contains 13 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 698/698 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 423 transition count 697
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 423 transition count 693
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 419 transition count 693
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 417 transition count 695
Applied a total of 14 rules in 34 ms. Remains 417 /424 variables (removed 7) and now considering 695/698 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 417/424 places, 695/698 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 159638 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159638 steps, saw 110183 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 695 rows 417 cols
[2023-03-19 17:15:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-19 17:15:43] [INFO ] [Real]Absence check using 200 positive place invariants in 17 ms returned sat
[2023-03-19 17:15:43] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 17:15:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2023-03-19 17:15:44] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 17:15:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:15:44] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 17:15:44] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 17:15:44] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 132 ms.
Support contains 7 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 695/695 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 417 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 416 transition count 694
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 416 transition count 691
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 413 transition count 691
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 409 transition count 695
Applied a total of 16 rules in 24 ms. Remains 409 /417 variables (removed 8) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 409/417 places, 695/695 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 196786 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196786 steps, saw 135073 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 695 rows 409 cols
[2023-03-19 17:15:48] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:15:48] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-19 17:15:48] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:15:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 21 ms returned sat
[2023-03-19 17:15:48] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:15:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:15:48] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 17:15:48] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-19 17:15:48] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 7 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 409 /409 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 409/409 places, 695/695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 409 /409 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2023-03-19 17:15:48] [INFO ] Invariant cache hit.
[2023-03-19 17:15:48] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-19 17:15:49] [INFO ] Invariant cache hit.
[2023-03-19 17:15:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:15:49] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-19 17:15:49] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-19 17:15:49] [INFO ] Invariant cache hit.
[2023-03-19 17:15:49] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 409/409 places, 695/695 transitions.
Graph (trivial) has 192 edges and 409 vertex of which 4 / 409 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1396 edges and 407 vertex of which 405 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 189 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 401 transition count 686
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 188 edges and 399 vertex of which 6 / 399 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 396 transition count 677
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 186 edges and 393 vertex of which 8 / 393 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 389 transition count 666
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 381 transition count 652
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 377 vertex of which 6 / 377 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 374 transition count 638
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 174 edges and 371 vertex of which 4 / 371 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 87 place count 369 transition count 628
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 171 edges and 367 vertex of which 2 / 367 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 9 rules applied. Total rules applied 96 place count 366 transition count 622
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 101 place count 365 transition count 618
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 101 place count 365 transition count 617
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 104 place count 363 transition count 617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 107 place count 361 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 168 edges and 361 vertex of which 2 / 361 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 111 place count 360 transition count 613
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 169 edges and 359 vertex of which 4 / 359 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 115 place count 357 transition count 611
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 167 edges and 355 vertex of which 2 / 355 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 8 rules applied. Total rules applied 123 place count 354 transition count 606
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 166 edges and 353 vertex of which 2 / 353 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 130 place count 352 transition count 601
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 165 edges and 351 vertex of which 2 / 351 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 135 place count 350 transition count 598
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 140 place count 349 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 140 place count 349 transition count 593
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 143 place count 347 transition count 593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 146 place count 345 transition count 592
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 149 place count 345 transition count 589
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 153 place count 345 transition count 585
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 155 place count 345 transition count 585
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 156 place count 345 transition count 584
Applied a total of 156 rules in 97 ms. Remains 345 /409 variables (removed 64) and now considering 584/695 (removed 111) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 584 rows 345 cols
[2023-03-19 17:15:49] [INFO ] Computed 168 place invariants in 2 ms
[2023-03-19 17:15:49] [INFO ] [Real]Absence check using 168 positive place invariants in 19 ms returned sat
[2023-03-19 17:15:50] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:15:50] [INFO ] [Nat]Absence check using 168 positive place invariants in 24 ms returned sat
[2023-03-19 17:15:50] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:15:50] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 17:15:50] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 601 stabilizing places and 601 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 1 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 255 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2023-03-19 17:15:51] [INFO ] Computed 201 place invariants in 18 ms
[2023-03-19 17:15:51] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-19 17:15:51] [INFO ] Invariant cache hit.
[2023-03-19 17:15:53] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-03-19 17:15:53] [INFO ] Invariant cache hit.
[2023-03-19 17:15:53] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3006 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s522 0), p0:(EQ s522 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-00 finished in 3404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(!p1))||G(!p1))))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 283 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
[2023-03-19 17:15:54] [INFO ] Invariant cache hit.
[2023-03-19 17:15:55] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-19 17:15:55] [INFO ] Invariant cache hit.
[2023-03-19 17:15:56] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-19 17:15:56] [INFO ] Invariant cache hit.
[2023-03-19 17:15:57] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3198 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 91 ms :[p1, p1]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s55 1), p1:(AND (EQ s1060 1) (EQ s1074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1360 ms.
Product exploration explored 100000 steps with 50000 reset in 1063 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1951 stabilizing places and 598/1951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 10 factoid took 302 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-01 finished in 6072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&F(G(p2)))))))'
Support contains 5 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1416 transition count 1416
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1092 place count 1416 transition count 1023
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1878 place count 1023 transition count 1023
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1887 place count 1014 transition count 1014
Iterating global reduction 2 with 9 rules applied. Total rules applied 1896 place count 1014 transition count 1014
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1896 place count 1014 transition count 1006
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1912 place count 1006 transition count 1006
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2809 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3011 place count 457 transition count 656
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3107 place count 409 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3109 place count 407 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3110 place count 406 transition count 702
Applied a total of 3110 rules in 309 ms. Remains 406 /1963 variables (removed 1557) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 406 cols
[2023-03-19 17:16:00] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:16:00] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 17:16:00] [INFO ] Invariant cache hit.
[2023-03-19 17:16:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:01] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-19 17:16:01] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:01] [INFO ] Invariant cache hit.
[2023-03-19 17:16:01] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1963 places, 702/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1338 ms. Remains : 406/1963 places, 702/1963 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s234 0), p1:(EQ s333 0), p2:(OR (EQ s252 0) (EQ s262 0) (EQ s269 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26 reset in 600 ms.
Product exploration explored 100000 steps with 25 reset in 638 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/406 stabilizing places and 2/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 16 factoid took 852 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 17:16:04] [INFO ] Invariant cache hit.
[2023-03-19 17:16:04] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 17:16:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-19 17:16:05] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 17:16:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:05] [INFO ] After 174ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 17:16:05] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-19 17:16:05] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 286 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 702/702 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 406 transition count 701
Applied a total of 1 rules in 18 ms. Remains 406 /406 variables (removed 0) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 406/406 places, 701/702 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 324242 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 324242 steps, saw 84059 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :5
Running SMT prover for 2 properties.
// Phase 1: matrix 701 rows 406 cols
[2023-03-19 17:16:09] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:16:09] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-19 17:16:10] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:10] [INFO ] After 35ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:10] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 17:16:10] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 406/406 places, 701/701 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 327294 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327294 steps, saw 84561 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:16:13] [INFO ] Invariant cache hit.
[2023-03-19 17:16:13] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2023-03-19 17:16:13] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:13] [INFO ] After 33ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:13] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 17:16:13] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 406/406 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2023-03-19 17:16:13] [INFO ] Invariant cache hit.
[2023-03-19 17:16:14] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-19 17:16:14] [INFO ] Invariant cache hit.
[2023-03-19 17:16:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:14] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-19 17:16:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:14] [INFO ] Invariant cache hit.
[2023-03-19 17:16:15] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 406/406 places, 701/701 transitions.
Graph (trivial) has 197 edges and 406 vertex of which 4 / 406 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1397 edges and 404 vertex of which 402 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 400 vertex of which 4 / 400 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 398 transition count 692
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 396 vertex of which 6 / 396 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 393 transition count 683
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 390 vertex of which 8 / 390 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 386 transition count 672
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 382 vertex of which 8 / 382 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 378 transition count 658
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 374 vertex of which 8 / 374 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 370 transition count 644
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 366 vertex of which 8 / 366 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 362 transition count 630
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 358 vertex of which 8 / 358 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 354 transition count 616
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 350 vertex of which 8 / 350 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 346 transition count 602
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 342 vertex of which 8 / 342 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 338 transition count 588
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 161 edges and 335 vertex of which 4 / 335 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 165 place count 333 transition count 576
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 158 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 174 place count 330 transition count 570
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 179 place count 329 transition count 566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 182 place count 327 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 186 place count 327 transition count 561
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 193 place count 327 transition count 554
Applied a total of 193 rules in 56 ms. Remains 327 /406 variables (removed 79) and now considering 554/701 (removed 147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 554 rows 327 cols
[2023-03-19 17:16:15] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 17:16:15] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2023-03-19 17:16:15] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 17:16:15] [INFO ] After 46ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:15] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 17:16:15] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1160 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 702/702 transitions.
Applied a total of 0 rules in 22 ms. Remains 406 /406 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 406 cols
[2023-03-19 17:16:16] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:16:17] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-19 17:16:17] [INFO ] Invariant cache hit.
[2023-03-19 17:16:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:17] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2023-03-19 17:16:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 17:16:17] [INFO ] Invariant cache hit.
[2023-03-19 17:16:18] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1142 ms. Remains : 406/406 places, 702/702 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/406 stabilizing places and 2/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 16 factoid took 860 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 17:16:19] [INFO ] Invariant cache hit.
[2023-03-19 17:16:19] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:16:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-19 17:16:20] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:16:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:20] [INFO ] After 57ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 17:16:20] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-19 17:16:20] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 180 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 702/702 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 406 transition count 701
Applied a total of 1 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 406/406 places, 701/702 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 701 rows 406 cols
[2023-03-19 17:16:20] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-19 17:16:20] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-19 17:16:20] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:20] [INFO ] After 33ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:21] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 17:16:21] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 406/406 places, 701/701 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 238368 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238368 steps, saw 71655 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:16:24] [INFO ] Invariant cache hit.
[2023-03-19 17:16:24] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-19 17:16:24] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:24] [INFO ] After 34ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:24] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 17:16:24] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 406/406 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2023-03-19 17:16:24] [INFO ] Invariant cache hit.
[2023-03-19 17:16:25] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-19 17:16:25] [INFO ] Invariant cache hit.
[2023-03-19 17:16:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:25] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-19 17:16:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:25] [INFO ] Invariant cache hit.
[2023-03-19 17:16:26] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1122 ms. Remains : 406/406 places, 701/701 transitions.
Graph (trivial) has 197 edges and 406 vertex of which 4 / 406 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1397 edges and 404 vertex of which 402 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 400 vertex of which 4 / 400 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 398 transition count 692
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 396 vertex of which 6 / 396 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 393 transition count 683
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 390 vertex of which 8 / 390 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 386 transition count 672
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 382 vertex of which 8 / 382 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 378 transition count 658
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 374 vertex of which 8 / 374 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 370 transition count 644
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 366 vertex of which 8 / 366 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 362 transition count 630
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 358 vertex of which 8 / 358 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 354 transition count 616
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 350 vertex of which 8 / 350 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 346 transition count 602
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 342 vertex of which 8 / 342 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 338 transition count 588
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 161 edges and 335 vertex of which 4 / 335 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 165 place count 333 transition count 576
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 158 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 174 place count 330 transition count 570
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 179 place count 329 transition count 566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 182 place count 327 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 186 place count 327 transition count 561
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 193 place count 327 transition count 554
Applied a total of 193 rules in 45 ms. Remains 327 /406 variables (removed 79) and now considering 554/701 (removed 147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 554 rows 327 cols
[2023-03-19 17:16:26] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-19 17:16:26] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:16:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-19 17:16:26] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 17:16:26] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:16:26] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:16:26] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1409 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 698 ms.
Product exploration explored 100000 steps with 23 reset in 637 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 702/702 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 406 cols
[2023-03-19 17:16:29] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-19 17:16:29] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-19 17:16:29] [INFO ] Invariant cache hit.
[2023-03-19 17:16:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:30] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-19 17:16:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 17:16:30] [INFO ] Invariant cache hit.
[2023-03-19 17:16:30] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1028 ms. Remains : 406/406 places, 702/702 transitions.
Treatment of property ShieldRVt-PT-050B-LTLFireability-02 finished in 30342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 1962 transition count 1420
Reduce places removed 542 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 543 rules applied. Total rules applied 1085 place count 1420 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1086 place count 1419 transition count 1419
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1086 place count 1419 transition count 1025
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 1874 place count 1025 transition count 1025
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1883 place count 1016 transition count 1016
Iterating global reduction 3 with 9 rules applied. Total rules applied 1892 place count 1016 transition count 1016
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1892 place count 1016 transition count 1007
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1910 place count 1007 transition count 1007
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2804 place count 560 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2805 place count 560 transition count 559
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2807 place count 559 transition count 558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3009 place count 458 transition count 658
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3103 place count 411 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3105 place count 409 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3106 place count 408 transition count 702
Applied a total of 3106 rules in 293 ms. Remains 408 /1963 variables (removed 1555) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 408 cols
[2023-03-19 17:16:30] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:16:31] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-19 17:16:31] [INFO ] Invariant cache hit.
[2023-03-19 17:16:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 17:16:31] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-19 17:16:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:31] [INFO ] Invariant cache hit.
[2023-03-19 17:16:32] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 408/1963 places, 702/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1358 ms. Remains : 408/1963 places, 702/1963 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s345 1)), p0:(AND (EQ s80 1) (EQ s84 1) (EQ s91 1) (EQ s345 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-03 finished in 1468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1962 transition count 1414
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1020
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1894 place count 1010 transition count 1010
Iterating global reduction 2 with 10 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1002
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1002 transition count 1002
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 654
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3111 place count 407 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 405 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3114 place count 404 transition count 698
Applied a total of 3114 rules in 277 ms. Remains 404 /1963 variables (removed 1559) and now considering 698/1963 (removed 1265) transitions.
// Phase 1: matrix 698 rows 404 cols
[2023-03-19 17:16:32] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-19 17:16:32] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-19 17:16:32] [INFO ] Invariant cache hit.
[2023-03-19 17:16:33] [INFO ] State equation strengthened by 250 read => feed constraints.
[2023-03-19 17:16:34] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-19 17:16:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:34] [INFO ] Invariant cache hit.
[2023-03-19 17:16:34] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1963 places, 698/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2477 ms. Remains : 404/1963 places, 698/1963 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s335 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 ShieldRVt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-04 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(((p2 U p3)&&p1)))) U G(!p2)))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1953 transition count 1953
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1953 transition count 1953
Applied a total of 20 rules in 279 ms. Remains 1953 /1963 variables (removed 10) and now considering 1953/1963 (removed 10) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:16:35] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-19 17:16:35] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-19 17:16:35] [INFO ] Invariant cache hit.
[2023-03-19 17:16:37] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2023-03-19 17:16:37] [INFO ] Invariant cache hit.
[2023-03-19 17:16:38] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1963 places, 1953/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3400 ms. Remains : 1953/1963 places, 1953/1963 transitions.
Stuttering acceptance computed with spot in 357 ms :[p2, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (OR (NOT p3) (NOT p1)), true, (NOT p3), (OR (AND (NOT p1) p2) (AND p2 (NOT p3))), p2]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p3)) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p3))), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 4}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s1720 1), p0:(EQ s181 1), p3:(EQ s1116 1), p1:(AND (EQ s1720 1) (EQ s1116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3177 steps with 0 reset in 35 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-05 finished in 3832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1416 transition count 1416
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1092 place count 1416 transition count 1020
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1892 place count 1012 transition count 1012
Iterating global reduction 2 with 8 rules applied. Total rules applied 1900 place count 1012 transition count 1012
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1900 place count 1012 transition count 1005
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1914 place count 1005 transition count 1005
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 1 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 699
Applied a total of 3116 rules in 296 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2023-03-19 17:16:38] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:16:39] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-19 17:16:39] [INFO ] Invariant cache hit.
[2023-03-19 17:16:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:39] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-19 17:16:39] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 17:16:39] [INFO ] Invariant cache hit.
[2023-03-19 17:16:39] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1392 ms. Remains : 403/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s141 1) (EQ s150 0)), p0:(EQ s150 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14678 reset in 462 ms.
Product exploration explored 100000 steps with 14684 reset in 531 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:16:41] [INFO ] Invariant cache hit.
[2023-03-19 17:16:41] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-19 17:16:41] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:41] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:42] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 17:16:42] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 402 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 401 transition count 696
Applied a total of 4 rules in 19 ms. Remains 401 /403 variables (removed 2) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 401/403 places, 696/699 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3777 steps, run visited all 1 properties in 35 ms. (steps per millisecond=107 )
Probabilistic random walk after 3777 steps, saw 2153 distinct states, run finished after 36 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2023-03-19 17:16:42] [INFO ] Invariant cache hit.
[2023-03-19 17:16:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-19 17:16:42] [INFO ] Invariant cache hit.
[2023-03-19 17:16:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:43] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-19 17:16:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 17:16:43] [INFO ] Invariant cache hit.
[2023-03-19 17:16:43] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1174 ms. Remains : 403/403 places, 699/699 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:16:44] [INFO ] Invariant cache hit.
[2023-03-19 17:16:44] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 21 ms returned sat
[2023-03-19 17:16:44] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:44] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:44] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 17:16:44] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 402 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 401 transition count 696
Applied a total of 4 rules in 22 ms. Remains 401 /403 variables (removed 2) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 401/403 places, 696/699 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3777 steps, run visited all 1 properties in 39 ms. (steps per millisecond=96 )
Probabilistic random walk after 3777 steps, saw 2153 distinct states, run finished after 39 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14546 reset in 551 ms.
Product exploration explored 100000 steps with 14647 reset in 558 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2023-03-19 17:16:46] [INFO ] Invariant cache hit.
[2023-03-19 17:16:46] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-19 17:16:46] [INFO ] Invariant cache hit.
[2023-03-19 17:16:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:16:47] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-19 17:16:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:16:47] [INFO ] Invariant cache hit.
[2023-03-19 17:16:47] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 992 ms. Remains : 403/403 places, 699/699 transitions.
Treatment of property ShieldRVt-PT-050B-LTLFireability-06 finished in 8917 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((G(p0)||(p1&&X(G(p2))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 202 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:16:47] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-19 17:16:48] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 17:16:48] [INFO ] Invariant cache hit.
[2023-03-19 17:16:49] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2023-03-19 17:16:49] [INFO ] Invariant cache hit.
[2023-03-19 17:16:50] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2760 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s958 0), p0:(EQ s958 1), p2:(EQ s818 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, 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 0 reset in 583 ms.
Product exploration explored 100000 steps with 3 reset in 700 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1952 stabilizing places and 598/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1481 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 17:16:53] [INFO ] Invariant cache hit.
[2023-03-19 17:16:53] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-19 17:16:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 60 ms returned sat
[2023-03-19 17:16:55] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-19 17:16:55] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 5 ms to minimize.
[2023-03-19 17:16:56] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 1 ms to minimize.
[2023-03-19 17:16:56] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 2 ms to minimize.
[2023-03-19 17:16:57] [INFO ] Deduced a trap composed of 37 places in 431 ms of which 1 ms to minimize.
[2023-03-19 17:16:57] [INFO ] Deduced a trap composed of 35 places in 406 ms of which 1 ms to minimize.
[2023-03-19 17:16:58] [INFO ] Deduced a trap composed of 32 places in 420 ms of which 1 ms to minimize.
[2023-03-19 17:16:58] [INFO ] Deduced a trap composed of 44 places in 408 ms of which 1 ms to minimize.
[2023-03-19 17:16:59] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
[2023-03-19 17:16:59] [INFO ] Deduced a trap composed of 51 places in 443 ms of which 1 ms to minimize.
[2023-03-19 17:17:00] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 2 ms to minimize.
[2023-03-19 17:17:00] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 1 ms to minimize.
[2023-03-19 17:17:01] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 1 ms to minimize.
[2023-03-19 17:17:01] [INFO ] Deduced a trap composed of 50 places in 367 ms of which 3 ms to minimize.
[2023-03-19 17:17:02] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 1 ms to minimize.
[2023-03-19 17:17:02] [INFO ] Deduced a trap composed of 25 places in 383 ms of which 1 ms to minimize.
[2023-03-19 17:17:02] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 1 ms to minimize.
[2023-03-19 17:17:03] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 0 ms to minimize.
[2023-03-19 17:17:03] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 1 ms to minimize.
[2023-03-19 17:17:04] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 1 ms to minimize.
[2023-03-19 17:17:04] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 1 ms to minimize.
[2023-03-19 17:17:05] [INFO ] Deduced a trap composed of 62 places in 340 ms of which 1 ms to minimize.
[2023-03-19 17:17:05] [INFO ] Deduced a trap composed of 67 places in 295 ms of which 1 ms to minimize.
[2023-03-19 17:17:05] [INFO ] Deduced a trap composed of 40 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:17:06] [INFO ] Deduced a trap composed of 41 places in 350 ms of which 1 ms to minimize.
[2023-03-19 17:17:06] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 0 ms to minimize.
[2023-03-19 17:17:06] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 1 ms to minimize.
[2023-03-19 17:17:07] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 0 ms to minimize.
[2023-03-19 17:17:07] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 1 ms to minimize.
[2023-03-19 17:17:08] [INFO ] Deduced a trap composed of 55 places in 287 ms of which 1 ms to minimize.
[2023-03-19 17:17:08] [INFO ] Deduced a trap composed of 59 places in 264 ms of which 1 ms to minimize.
[2023-03-19 17:17:08] [INFO ] Deduced a trap composed of 67 places in 367 ms of which 0 ms to minimize.
[2023-03-19 17:17:09] [INFO ] Deduced a trap composed of 77 places in 314 ms of which 1 ms to minimize.
[2023-03-19 17:17:09] [INFO ] Deduced a trap composed of 69 places in 322 ms of which 0 ms to minimize.
[2023-03-19 17:17:10] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 1 ms to minimize.
[2023-03-19 17:17:10] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 0 ms to minimize.
[2023-03-19 17:17:10] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 1 ms to minimize.
[2023-03-19 17:17:10] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 15549 ms
[2023-03-19 17:17:11] [INFO ] After 16949ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-19 17:17:11] [INFO ] After 17586ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 188 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1004
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2999 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 698
Applied a total of 3098 rules in 220 ms. Remains 403 /1952 variables (removed 1549) and now considering 698/1952 (removed 1254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 403/1952 places, 698/1952 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 217309 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217309 steps, saw 140094 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 698 rows 403 cols
[2023-03-19 17:17:15] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:17:15] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:17:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 19 ms returned sat
[2023-03-19 17:17:15] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:17:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:17:15] [INFO ] After 41ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:17:15] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-19 17:17:15] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 403/403 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-19 17:17:15] [INFO ] Invariant cache hit.
[2023-03-19 17:17:16] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-19 17:17:16] [INFO ] Invariant cache hit.
[2023-03-19 17:17:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:17:16] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-19 17:17:16] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 17:17:16] [INFO ] Invariant cache hit.
[2023-03-19 17:17:17] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 403/403 places, 698/698 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1387 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 680
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 403
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 389
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 375
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 95 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 13 rules applied. Total rules applied 485 place count 196 transition count 337
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 489 place count 195 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 491 place count 194 transition count 333
Graph (complete) has 661 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 492 place count 192 transition count 332
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 496 place count 192 transition count 328
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 30 with 4 rules applied. Total rules applied 500 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 502 place count 190 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 3 rules applied. Total rules applied 505 place count 188 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 509 place count 188 transition count 319
Applied a total of 509 rules in 52 ms. Remains 188 /403 variables (removed 215) and now considering 319/698 (removed 379) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 319 rows 188 cols
[2023-03-19 17:17:17] [INFO ] Computed 93 place invariants in 2 ms
[2023-03-19 17:17:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:17:17] [INFO ] [Nat]Absence check using 93 positive place invariants in 10 ms returned sat
[2023-03-19 17:17:17] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:17:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 17:17:17] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:17:17] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 17:17:17] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1400 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 115 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:17:19] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-19 17:17:19] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-19 17:17:19] [INFO ] Invariant cache hit.
[2023-03-19 17:17:21] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2023-03-19 17:17:21] [INFO ] Invariant cache hit.
[2023-03-19 17:17:22] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3132 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1952 stabilizing places and 598/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND p2 p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p0) p1)), (X (AND p2 p1)), (X p2), (X p1), (X (X (NOT (OR (AND p2 p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 p1))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 573 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:17:23] [INFO ] Invariant cache hit.
[2023-03-19 17:17:23] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:17:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 91 ms returned sat
[2023-03-19 17:17:24] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:17:25] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 2 ms to minimize.
[2023-03-19 17:17:25] [INFO ] Deduced a trap composed of 23 places in 420 ms of which 1 ms to minimize.
[2023-03-19 17:17:26] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 1 ms to minimize.
[2023-03-19 17:17:26] [INFO ] Deduced a trap composed of 37 places in 450 ms of which 1 ms to minimize.
[2023-03-19 17:17:27] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 1 ms to minimize.
[2023-03-19 17:17:27] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 1 ms to minimize.
[2023-03-19 17:17:28] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2023-03-19 17:17:28] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 2 ms to minimize.
[2023-03-19 17:17:29] [INFO ] Deduced a trap composed of 34 places in 375 ms of which 1 ms to minimize.
[2023-03-19 17:17:29] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 1 ms to minimize.
[2023-03-19 17:17:30] [INFO ] Deduced a trap composed of 38 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:17:30] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 1 ms to minimize.
[2023-03-19 17:17:31] [INFO ] Deduced a trap composed of 50 places in 355 ms of which 1 ms to minimize.
[2023-03-19 17:17:31] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 1 ms to minimize.
[2023-03-19 17:17:31] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 1 ms to minimize.
[2023-03-19 17:17:32] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 1 ms to minimize.
[2023-03-19 17:17:32] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 1 ms to minimize.
[2023-03-19 17:17:33] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 1 ms to minimize.
[2023-03-19 17:17:33] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 1 ms to minimize.
[2023-03-19 17:17:34] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2023-03-19 17:17:34] [INFO ] Deduced a trap composed of 48 places in 354 ms of which 1 ms to minimize.
[2023-03-19 17:17:34] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 1 ms to minimize.
[2023-03-19 17:17:35] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 1 ms to minimize.
[2023-03-19 17:17:35] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 1 ms to minimize.
[2023-03-19 17:17:36] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 1 ms to minimize.
[2023-03-19 17:17:36] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 1 ms to minimize.
[2023-03-19 17:17:37] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 1 ms to minimize.
[2023-03-19 17:17:37] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 1 ms to minimize.
[2023-03-19 17:17:37] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 1 ms to minimize.
[2023-03-19 17:17:38] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 9 ms to minimize.
[2023-03-19 17:17:38] [INFO ] Deduced a trap composed of 59 places in 294 ms of which 1 ms to minimize.
[2023-03-19 17:17:38] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 1 ms to minimize.
[2023-03-19 17:17:39] [INFO ] Deduced a trap composed of 58 places in 301 ms of which 1 ms to minimize.
[2023-03-19 17:17:39] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 1 ms to minimize.
[2023-03-19 17:17:39] [INFO ] Deduced a trap composed of 65 places in 306 ms of which 0 ms to minimize.
[2023-03-19 17:17:40] [INFO ] Deduced a trap composed of 62 places in 290 ms of which 1 ms to minimize.
[2023-03-19 17:17:40] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 1 ms to minimize.
[2023-03-19 17:17:40] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 15907 ms
[2023-03-19 17:17:40] [INFO ] After 17016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-19 17:17:41] [INFO ] After 17670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1004
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2999 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 698
Applied a total of 3098 rules in 248 ms. Remains 403 /1952 variables (removed 1549) and now considering 698/1952 (removed 1254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 403/1952 places, 698/1952 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 241069 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241069 steps, saw 155345 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 698 rows 403 cols
[2023-03-19 17:17:44] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:17:44] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:17:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-19 17:17:45] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:17:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:17:45] [INFO ] After 44ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:17:45] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 17:17:45] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 403/403 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-19 17:17:45] [INFO ] Invariant cache hit.
[2023-03-19 17:17:45] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-19 17:17:45] [INFO ] Invariant cache hit.
[2023-03-19 17:17:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:17:45] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-19 17:17:45] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:17:45] [INFO ] Invariant cache hit.
[2023-03-19 17:17:46] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 994 ms. Remains : 403/403 places, 698/698 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1387 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 680
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 403
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 389
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 375
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 95 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 13 rules applied. Total rules applied 485 place count 196 transition count 337
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 489 place count 195 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 491 place count 194 transition count 333
Graph (complete) has 661 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 492 place count 192 transition count 332
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 496 place count 192 transition count 328
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 30 with 4 rules applied. Total rules applied 500 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 502 place count 190 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 3 rules applied. Total rules applied 505 place count 188 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 509 place count 188 transition count 319
Applied a total of 509 rules in 72 ms. Remains 188 /403 variables (removed 215) and now considering 319/698 (removed 379) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 319 rows 188 cols
[2023-03-19 17:17:46] [INFO ] Computed 93 place invariants in 2 ms
[2023-03-19 17:17:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:17:46] [INFO ] [Nat]Absence check using 93 positive place invariants in 12 ms returned sat
[2023-03-19 17:17:46] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:17:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 17:17:46] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:17:46] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 17:17:46] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND p2 p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p0) p1)), (X (AND p2 p1)), (X p2), (X p1), (X (X (NOT (OR (AND p2 p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 p1))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p2 p1 (NOT p0)))), (F (OR (AND p2 p0) (NOT p1)))]
Knowledge based reduction with 16 factoid took 645 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 646 ms.
Product exploration explored 100000 steps with 0 reset in 681 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1952
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 547 place count 1952 transition count 2153
Deduced a syphon composed of 749 places in 4 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 749 place count 1952 transition count 2153
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1347 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1347 place count 1952 transition count 2153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1348 place count 1952 transition count 2152
Renaming transitions due to excessive name length > 1024 char.
Discarding 397 places :
Symmetric choice reduction at 2 with 397 rule applications. Total rules 1745 place count 1555 transition count 1755
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 397 rules applied. Total rules applied 2142 place count 1555 transition count 1755
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2143 place count 1555 transition count 1755
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2145 place count 1553 transition count 1753
Deduced a syphon composed of 949 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2147 place count 1553 transition count 1753
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 1050 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2248 place count 1553 transition count 2478
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2350 place count 1451 transition count 2274
Deduced a syphon composed of 948 places in 3 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2452 place count 1451 transition count 2274
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -705
Deduced a syphon composed of 1046 places in 0 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2550 place count 1451 transition count 2979
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 2648 place count 1353 transition count 2783
Deduced a syphon composed of 948 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2746 place count 1353 transition count 2783
Deduced a syphon composed of 948 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2749 place count 1353 transition count 2780
Deduced a syphon composed of 948 places in 1 ms
Applied a total of 2749 rules in 1292 ms. Remains 1353 /1952 variables (removed 599) and now considering 2780/1952 (removed -828) transitions.
[2023-03-19 17:17:50] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2780 rows 1353 cols
[2023-03-19 17:17:50] [INFO ] Computed 201 place invariants in 41 ms
[2023-03-19 17:17:51] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1353/1952 places, 2780/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2387 ms. Remains : 1353/1952 places, 2780/1952 transitions.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 79 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:17:51] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-19 17:17:52] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-19 17:17:52] [INFO ] Invariant cache hit.
[2023-03-19 17:17:53] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-03-19 17:17:53] [INFO ] Invariant cache hit.
[2023-03-19 17:17:54] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2977 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 67289 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))||G(p1))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 193 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2023-03-19 17:17:55] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 17:17:55] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-19 17:17:55] [INFO ] Invariant cache hit.
[2023-03-19 17:17:56] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1738 ms to find 0 implicit places.
[2023-03-19 17:17:56] [INFO ] Invariant cache hit.
[2023-03-19 17:17:57] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2821 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s126 1), p1:(NEQ s1885 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 958 ms.
Product exploration explored 100000 steps with 33333 reset in 786 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-08 finished in 4933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (G((p1||G(!p1)))||(G(p2)&&(p1||G(!p1)))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 254 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:17:59] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 17:18:00] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-19 17:18:00] [INFO ] Invariant cache hit.
[2023-03-19 17:18:01] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2023-03-19 17:18:01] [INFO ] Invariant cache hit.
[2023-03-19 17:18:02] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3015 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (AND (NOT p2) p1), false, false, false, false, false, (AND p1 (NOT p0)), p1, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2), acceptance={} source=1 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(EQ s1355 1), p2:(NEQ s623 1), p0:(EQ s623 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1280 ms.
Product exploration explored 100000 steps with 50000 reset in 1036 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/1952 stabilizing places and 599/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 15 factoid took 254 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-09 finished in 6020 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 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 212 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:18:05] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 17:18:06] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-19 17:18:06] [INFO ] Invariant cache hit.
[2023-03-19 17:18:07] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-19 17:18:07] [INFO ] Invariant cache hit.
[2023-03-19 17:18:08] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-10 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 (EQ s98 1) (AND (EQ s1623 1) (EQ s1627 1) (EQ s1640 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 50235 steps with 5 reset in 208 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-10 finished in 3380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1962 transition count 1415
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1415 transition count 1415
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1094 place count 1415 transition count 1020
Deduced a syphon composed of 395 places in 2 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1893 place count 1011 transition count 1011
Iterating global reduction 2 with 9 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1003
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1918 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2817 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3019 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3113 place count 406 transition count 698
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 696
Applied a total of 3116 rules in 211 ms. Remains 403 /1963 variables (removed 1560) and now considering 696/1963 (removed 1267) transitions.
// Phase 1: matrix 696 rows 403 cols
[2023-03-19 17:18:09] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-19 17:18:09] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-19 17:18:09] [INFO ] Invariant cache hit.
[2023-03-19 17:18:10] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-19 17:18:10] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 17:18:10] [INFO ] Invariant cache hit.
[2023-03-19 17:18:10] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 696/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1312 ms. Remains : 403/1963 places, 696/1963 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s59 1), p1:(EQ s334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-12 finished in 1404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 548 rules applied. Total rules applied 1094 place count 1416 transition count 1414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1019
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1896 place count 1009 transition count 1009
Iterating global reduction 3 with 10 rules applied. Total rules applied 1906 place count 1009 transition count 1009
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1906 place count 1009 transition count 1000
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1924 place count 1000 transition count 1000
Performed 443 Post agglomeration using F-continuation condition.Transition count delta: 443
Deduced a syphon composed of 443 places in 0 ms
Reduce places removed 443 places and 0 transitions.
Iterating global reduction 3 with 886 rules applied. Total rules applied 2810 place count 557 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2811 place count 557 transition count 556
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2813 place count 556 transition count 555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3015 place count 455 transition count 655
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3111 place count 407 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3113 place count 405 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3114 place count 404 transition count 701
Applied a total of 3114 rules in 290 ms. Remains 404 /1963 variables (removed 1559) and now considering 701/1963 (removed 1262) transitions.
// Phase 1: matrix 701 rows 404 cols
[2023-03-19 17:18:10] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-19 17:18:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-19 17:18:11] [INFO ] Invariant cache hit.
[2023-03-19 17:18:11] [INFO ] State equation strengthened by 105 read => feed constraints.
[2023-03-19 17:18:11] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-19 17:18:11] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:18:11] [INFO ] Invariant cache hit.
[2023-03-19 17:18:12] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1963 places, 701/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1617 ms. Remains : 404/1963 places, 701/1963 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3864 steps with 3 reset in 20 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-13 finished in 1710 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||G(F(p1))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1953 transition count 1953
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1953 transition count 1953
Applied a total of 20 rules in 170 ms. Remains 1953 /1963 variables (removed 10) and now considering 1953/1963 (removed 10) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:18:12] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 17:18:12] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-19 17:18:12] [INFO ] Invariant cache hit.
[2023-03-19 17:18:14] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
[2023-03-19 17:18:14] [INFO ] Invariant cache hit.
[2023-03-19 17:18:15] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1963 places, 1953/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2951 ms. Remains : 1953/1963 places, 1953/1963 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1123 1), p1:(EQ s350 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 489 ms.
Product exploration explored 100000 steps with 2 reset in 631 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 148482 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148482 steps, saw 87659 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:18:19] [INFO ] Invariant cache hit.
[2023-03-19 17:18:20] [INFO ] [Real]Absence check using 201 positive place invariants in 74 ms returned sat
[2023-03-19 17:18:20] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:18:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 78 ms returned sat
[2023-03-19 17:18:21] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:18:22] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 3 ms to minimize.
[2023-03-19 17:18:22] [INFO ] Deduced a trap composed of 21 places in 475 ms of which 1 ms to minimize.
[2023-03-19 17:18:23] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 2 ms to minimize.
[2023-03-19 17:18:23] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 1 ms to minimize.
[2023-03-19 17:18:24] [INFO ] Deduced a trap composed of 34 places in 418 ms of which 1 ms to minimize.
[2023-03-19 17:18:24] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 1 ms to minimize.
[2023-03-19 17:18:25] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 1 ms to minimize.
[2023-03-19 17:18:25] [INFO ] Deduced a trap composed of 36 places in 409 ms of which 1 ms to minimize.
[2023-03-19 17:18:26] [INFO ] Deduced a trap composed of 40 places in 436 ms of which 1 ms to minimize.
[2023-03-19 17:18:26] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 2 ms to minimize.
[2023-03-19 17:18:27] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 1 ms to minimize.
[2023-03-19 17:18:27] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 1 ms to minimize.
[2023-03-19 17:18:28] [INFO ] Deduced a trap composed of 34 places in 409 ms of which 1 ms to minimize.
[2023-03-19 17:18:28] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 1 ms to minimize.
[2023-03-19 17:18:29] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 1 ms to minimize.
[2023-03-19 17:18:29] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 1 ms to minimize.
[2023-03-19 17:18:30] [INFO ] Deduced a trap composed of 44 places in 369 ms of which 1 ms to minimize.
[2023-03-19 17:18:30] [INFO ] Deduced a trap composed of 41 places in 386 ms of which 1 ms to minimize.
[2023-03-19 17:18:30] [INFO ] Deduced a trap composed of 57 places in 358 ms of which 1 ms to minimize.
[2023-03-19 17:18:31] [INFO ] Deduced a trap composed of 51 places in 341 ms of which 1 ms to minimize.
[2023-03-19 17:18:31] [INFO ] Deduced a trap composed of 43 places in 354 ms of which 4 ms to minimize.
[2023-03-19 17:18:32] [INFO ] Deduced a trap composed of 53 places in 346 ms of which 2 ms to minimize.
[2023-03-19 17:18:32] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:18:33] [INFO ] Deduced a trap composed of 59 places in 326 ms of which 1 ms to minimize.
[2023-03-19 17:18:33] [INFO ] Deduced a trap composed of 65 places in 327 ms of which 1 ms to minimize.
[2023-03-19 17:18:33] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 1 ms to minimize.
[2023-03-19 17:18:34] [INFO ] Deduced a trap composed of 52 places in 341 ms of which 1 ms to minimize.
[2023-03-19 17:18:34] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 0 ms to minimize.
[2023-03-19 17:18:34] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 0 ms to minimize.
[2023-03-19 17:18:35] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 1 ms to minimize.
[2023-03-19 17:18:35] [INFO ] Deduced a trap composed of 59 places in 308 ms of which 1 ms to minimize.
[2023-03-19 17:18:36] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 1 ms to minimize.
[2023-03-19 17:18:36] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 1 ms to minimize.
[2023-03-19 17:18:36] [INFO ] Deduced a trap composed of 55 places in 288 ms of which 1 ms to minimize.
[2023-03-19 17:18:37] [INFO ] Deduced a trap composed of 59 places in 278 ms of which 1 ms to minimize.
[2023-03-19 17:18:37] [INFO ] Deduced a trap composed of 59 places in 276 ms of which 0 ms to minimize.
[2023-03-19 17:18:37] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 1 ms to minimize.
[2023-03-19 17:18:38] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 1 ms to minimize.
[2023-03-19 17:18:38] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:18:38] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 1 ms to minimize.
[2023-03-19 17:18:38] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 17255 ms
[2023-03-19 17:18:39] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 1 ms to minimize.
[2023-03-19 17:18:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2023-03-19 17:18:39] [INFO ] After 18831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-19 17:18:39] [INFO ] After 19501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 95 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1406
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1406 transition count 1406
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1406 transition count 1006
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3003 place count 452 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 696
Applied a total of 3102 rules in 253 ms. Remains 402 /1953 variables (removed 1551) and now considering 696/1953 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 402/1953 places, 696/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 227765 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227765 steps, saw 142677 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 696 rows 402 cols
[2023-03-19 17:18:43] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-19 17:18:43] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-19 17:18:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:18:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-19 17:18:43] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:18:43] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-19 17:18:44] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 135 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2023-03-19 17:18:44] [INFO ] Invariant cache hit.
[2023-03-19 17:18:44] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-19 17:18:44] [INFO ] Invariant cache hit.
[2023-03-19 17:18:44] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-19 17:18:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 17:18:44] [INFO ] Invariant cache hit.
[2023-03-19 17:18:45] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1084 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 196 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 195 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 318 transition count 555
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 310 transition count 541
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 302 transition count 527
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 294 transition count 513
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 286 transition count 499
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 278 transition count 485
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 270 transition count 471
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 262 transition count 457
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 254 transition count 443
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 246 transition count 429
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 112 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 103 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-19 17:18:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 17:18:45] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:18:45] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:18:45] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 17:18:45] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 138 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:18:46] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-19 17:18:46] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-19 17:18:46] [INFO ] Invariant cache hit.
[2023-03-19 17:18:48] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2023-03-19 17:18:48] [INFO ] Invariant cache hit.
[2023-03-19 17:18:48] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3127 ms. Remains : 1953/1953 places, 1953/1953 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 180248 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180248 steps, saw 99953 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:18:52] [INFO ] Invariant cache hit.
[2023-03-19 17:18:52] [INFO ] [Real]Absence check using 201 positive place invariants in 76 ms returned sat
[2023-03-19 17:18:53] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:18:53] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-19 17:18:54] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:18:54] [INFO ] Deduced a trap composed of 32 places in 447 ms of which 2 ms to minimize.
[2023-03-19 17:18:55] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 1 ms to minimize.
[2023-03-19 17:18:55] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
[2023-03-19 17:18:55] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:18:56] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 0 ms to minimize.
[2023-03-19 17:18:56] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 1 ms to minimize.
[2023-03-19 17:18:56] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:18:57] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 1 ms to minimize.
[2023-03-19 17:18:57] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 0 ms to minimize.
[2023-03-19 17:18:57] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 1 ms to minimize.
[2023-03-19 17:18:58] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 1 ms to minimize.
[2023-03-19 17:18:58] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 2 ms to minimize.
[2023-03-19 17:18:59] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 1 ms to minimize.
[2023-03-19 17:18:59] [INFO ] Deduced a trap composed of 53 places in 358 ms of which 1 ms to minimize.
[2023-03-19 17:18:59] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 1 ms to minimize.
[2023-03-19 17:19:00] [INFO ] Deduced a trap composed of 56 places in 315 ms of which 1 ms to minimize.
[2023-03-19 17:19:00] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 1 ms to minimize.
[2023-03-19 17:19:01] [INFO ] Deduced a trap composed of 41 places in 372 ms of which 1 ms to minimize.
[2023-03-19 17:19:01] [INFO ] Deduced a trap composed of 57 places in 323 ms of which 1 ms to minimize.
[2023-03-19 17:19:01] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:19:02] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 1 ms to minimize.
[2023-03-19 17:19:02] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 1 ms to minimize.
[2023-03-19 17:19:03] [INFO ] Deduced a trap composed of 51 places in 413 ms of which 1 ms to minimize.
[2023-03-19 17:19:03] [INFO ] Deduced a trap composed of 59 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:19:03] [INFO ] Deduced a trap composed of 65 places in 331 ms of which 1 ms to minimize.
[2023-03-19 17:19:04] [INFO ] Deduced a trap composed of 48 places in 329 ms of which 1 ms to minimize.
[2023-03-19 17:19:04] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 1 ms to minimize.
[2023-03-19 17:19:05] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 1 ms to minimize.
[2023-03-19 17:19:05] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 1 ms to minimize.
[2023-03-19 17:19:05] [INFO ] Deduced a trap composed of 63 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:19:06] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 1 ms to minimize.
[2023-03-19 17:19:06] [INFO ] Deduced a trap composed of 58 places in 312 ms of which 1 ms to minimize.
[2023-03-19 17:19:07] [INFO ] Deduced a trap composed of 52 places in 319 ms of which 1 ms to minimize.
[2023-03-19 17:19:07] [INFO ] Deduced a trap composed of 55 places in 319 ms of which 1 ms to minimize.
[2023-03-19 17:19:07] [INFO ] Deduced a trap composed of 59 places in 323 ms of which 1 ms to minimize.
[2023-03-19 17:19:08] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 1 ms to minimize.
[2023-03-19 17:19:08] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 1 ms to minimize.
[2023-03-19 17:19:08] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 1 ms to minimize.
[2023-03-19 17:19:09] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 1 ms to minimize.
[2023-03-19 17:19:09] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 0 ms to minimize.
[2023-03-19 17:19:09] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 15721 ms
[2023-03-19 17:19:10] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 0 ms to minimize.
[2023-03-19 17:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-19 17:19:10] [INFO ] After 17059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-19 17:19:10] [INFO ] After 17635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1406
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1406 transition count 1406
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1406 transition count 1006
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3003 place count 452 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 696
Applied a total of 3102 rules in 200 ms. Remains 402 /1953 variables (removed 1551) and now considering 696/1953 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 402/1953 places, 696/1953 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 283108 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283108 steps, saw 177842 distinct states, run finished after 3003 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 696 rows 402 cols
[2023-03-19 17:19:14] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:19:14] [INFO ] [Real]Absence check using 200 positive place invariants in 20 ms returned sat
[2023-03-19 17:19:14] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:19:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-19 17:19:14] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:19:14] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-19 17:19:14] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 89 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2023-03-19 17:19:14] [INFO ] Invariant cache hit.
[2023-03-19 17:19:15] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-19 17:19:15] [INFO ] Invariant cache hit.
[2023-03-19 17:19:15] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-19 17:19:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 17:19:15] [INFO ] Invariant cache hit.
[2023-03-19 17:19:15] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 196 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 195 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 318 transition count 555
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 310 transition count 541
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 302 transition count 527
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 294 transition count 513
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 286 transition count 499
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 278 transition count 485
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 270 transition count 471
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 262 transition count 457
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 254 transition count 443
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 246 transition count 429
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 112 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 57 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-19 17:19:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 17:19:15] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:19:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:19:15] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:19:15] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 17:19:15] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 488 ms.
Product exploration explored 100000 steps with 1 reset in 647 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1953
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 547 place count 1953 transition count 2155
Deduced a syphon composed of 749 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 749 place count 1953 transition count 2155
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1349 places in 3 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 1349 place count 1953 transition count 2155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1350 place count 1953 transition count 2154
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 1748 place count 1555 transition count 1756
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2146 place count 1555 transition count 1756
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 952 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2147 place count 1555 transition count 1756
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2149 place count 1553 transition count 1754
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2151 place count 1553 transition count 1754
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -729
Deduced a syphon composed of 1051 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2252 place count 1553 transition count 2483
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2354 place count 1451 transition count 2279
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2456 place count 1451 transition count 2279
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -698
Deduced a syphon composed of 1047 places in 0 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2554 place count 1451 transition count 2977
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 2653 place count 1352 transition count 2779
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 2752 place count 1352 transition count 2779
Deduced a syphon composed of 948 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2755 place count 1352 transition count 2776
Deduced a syphon composed of 948 places in 0 ms
Applied a total of 2755 rules in 809 ms. Remains 1352 /1953 variables (removed 601) and now considering 2776/1953 (removed -823) transitions.
[2023-03-19 17:19:18] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2776 rows 1352 cols
[2023-03-19 17:19:18] [INFO ] Computed 201 place invariants in 25 ms
[2023-03-19 17:19:20] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1352/1953 places, 2776/1953 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2200 ms. Remains : 1352/1953 places, 2776/1953 transitions.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 86 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:19:20] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-19 17:19:20] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 17:19:20] [INFO ] Invariant cache hit.
[2023-03-19 17:19:22] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2023-03-19 17:19:22] [INFO ] Invariant cache hit.
[2023-03-19 17:19:22] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2909 ms. Remains : 1953/1953 places, 1953/1953 transitions.
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 70777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&F(G(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
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((G(p0)||(p1&&X(G(p2))))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLFireability-07
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1962 transition count 1415
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1415 transition count 1415
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1094 place count 1415 transition count 1019
Deduced a syphon composed of 396 places in 2 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1895 place count 1010 transition count 1010
Iterating global reduction 2 with 9 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1002
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1002 transition count 1002
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 699
Applied a total of 3116 rules in 262 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2023-03-19 17:19:23] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:19:24] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-19 17:19:24] [INFO ] Invariant cache hit.
[2023-03-19 17:19:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:19:24] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-03-19 17:19:24] [INFO ] Invariant cache hit.
[2023-03-19 17:19:24] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1337 ms. Remains : 403/1963 places, 699/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s194 0), p0:(EQ s194 1), p2:(EQ s162 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10603 steps with 1 reset in 72 ms.
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 1709 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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||G(F(p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLFireability-15
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1962 transition count 1414
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1019
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 2 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2817 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3019 place count 453 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3115 place count 405 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3118 place count 402 transition count 697
Applied a total of 3118 rules in 275 ms. Remains 402 /1963 variables (removed 1561) and now considering 697/1963 (removed 1266) transitions.
// Phase 1: matrix 697 rows 402 cols
[2023-03-19 17:19:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:19:25] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-19 17:19:25] [INFO ] Invariant cache hit.
[2023-03-19 17:19:26] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2023-03-19 17:19:26] [INFO ] Invariant cache hit.
[2023-03-19 17:19:26] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 402/1963 places, 697/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1390 ms. Remains : 402/1963 places, 697/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s227 1), p1:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24 reset in 691 ms.
Product exploration explored 100000 steps with 22 reset in 632 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 p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29962 steps, run visited all 2 properties in 325 ms. (steps per millisecond=92 )
Probabilistic random walk after 29962 steps, saw 19010 distinct states, run finished after 325 ms. (steps per millisecond=92 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-19 17:19:29] [INFO ] Invariant cache hit.
[2023-03-19 17:19:29] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-19 17:19:29] [INFO ] Invariant cache hit.
[2023-03-19 17:19:30] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-19 17:19:30] [INFO ] Invariant cache hit.
[2023-03-19 17:19:30] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 402/402 places, 697/697 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 p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29962 steps, run visited all 2 properties in 251 ms. (steps per millisecond=119 )
Probabilistic random walk after 29962 steps, saw 19010 distinct states, run finished after 251 ms. (steps per millisecond=119 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23 reset in 470 ms.
Product exploration explored 100000 steps with 18 reset in 571 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-19 17:19:33] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 17:19:33] [INFO ] Invariant cache hit.
[2023-03-19 17:19:33] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 402/402 places, 697/697 transitions.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-19 17:19:33] [INFO ] Invariant cache hit.
[2023-03-19 17:19:33] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 17:19:33] [INFO ] Invariant cache hit.
[2023-03-19 17:19:34] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-19 17:19:34] [INFO ] Invariant cache hit.
[2023-03-19 17:19:34] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 402/402 places, 697/697 transitions.
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 9656 ms.
[2023-03-19 17:19:34] [INFO ] Flatten gal took : 70 ms
[2023-03-19 17:19:34] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 17:19:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1963 places, 1963 transitions and 4826 arcs took 11 ms.
Total runtime 276096 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1679246640732

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/899 11/32 ShieldRVt-PT-050B-LTLFireability-02 748517 m, 149703 m/sec, 1379723 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/899 22/32 ShieldRVt-PT-050B-LTLFireability-02 1506455 m, 151587 m/sec, 2786362 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/899 32/32 ShieldRVt-PT-050B-LTLFireability-02 2261673 m, 151043 m/sec, 4186330 t fired, .

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldRVt-PT-050B-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldRVt-PT-050B-LTLFireability-15
lola: time limit : 1193 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1193 5/32 ShieldRVt-PT-050B-LTLFireability-15 155174 m, 31034 m/sec, 552351 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1193 7/32 ShieldRVt-PT-050B-LTLFireability-15 292800 m, 27525 m/sec, 1072061 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1193 9/32 ShieldRVt-PT-050B-LTLFireability-15 410424 m, 23524 m/sec, 1582142 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1193 10/32 ShieldRVt-PT-050B-LTLFireability-15 524000 m, 22715 m/sec, 2111044 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1193 12/32 ShieldRVt-PT-050B-LTLFireability-15 656643 m, 26528 m/sec, 2646750 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1193 13/32 ShieldRVt-PT-050B-LTLFireability-15 796366 m, 27944 m/sec, 3204010 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1193 15/32 ShieldRVt-PT-050B-LTLFireability-15 927585 m, 26243 m/sec, 3743109 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1193 17/32 ShieldRVt-PT-050B-LTLFireability-15 1040638 m, 22610 m/sec, 4284659 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1193 18/32 ShieldRVt-PT-050B-LTLFireability-15 1151424 m, 22157 m/sec, 4814581 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1193 19/32 ShieldRVt-PT-050B-LTLFireability-15 1250456 m, 19806 m/sec, 5335268 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/1193 20/32 ShieldRVt-PT-050B-LTLFireability-15 1339359 m, 17780 m/sec, 5849741 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/1193 21/32 ShieldRVt-PT-050B-LTLFireability-15 1436784 m, 19485 m/sec, 6361252 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 65/1193 22/32 ShieldRVt-PT-050B-LTLFireability-15 1542438 m, 21130 m/sec, 6884499 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 70/1193 23/32 ShieldRVt-PT-050B-LTLFireability-15 1652723 m, 22057 m/sec, 7438165 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 75/1193 25/32 ShieldRVt-PT-050B-LTLFireability-15 1777823 m, 25020 m/sec, 8015170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 80/1193 26/32 ShieldRVt-PT-050B-LTLFireability-15 1900912 m, 24617 m/sec, 8603047 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 85/1193 28/32 ShieldRVt-PT-050B-LTLFireability-15 2016143 m, 23046 m/sec, 9154790 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 90/1193 29/32 ShieldRVt-PT-050B-LTLFireability-15 2115109 m, 19793 m/sec, 9681460 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 95/1193 30/32 ShieldRVt-PT-050B-LTLFireability-15 2210611 m, 19100 m/sec, 10232169 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 100/1193 31/32 ShieldRVt-PT-050B-LTLFireability-15 2317511 m, 21380 m/sec, 10778614 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 105/1193 32/32 ShieldRVt-PT-050B-LTLFireability-15 2422218 m, 20941 m/sec, 11303038 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ShieldRVt-PT-050B-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldRVt-PT-050B-LTLFireability-07
lola: time limit : 1734 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1734 5/32 ShieldRVt-PT-050B-LTLFireability-07 151264 m, 30252 m/sec, 536675 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1734 7/32 ShieldRVt-PT-050B-LTLFireability-07 291135 m, 27974 m/sec, 1065680 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1734 9/32 ShieldRVt-PT-050B-LTLFireability-07 412579 m, 24288 m/sec, 1592263 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1734 10/32 ShieldRVt-PT-050B-LTLFireability-07 529402 m, 23364 m/sec, 2132879 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1734 12/32 ShieldRVt-PT-050B-LTLFireability-07 653045 m, 24728 m/sec, 2632279 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1734 13/32 ShieldRVt-PT-050B-LTLFireability-07 777875 m, 24966 m/sec, 3127479 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1734 15/32 ShieldRVt-PT-050B-LTLFireability-07 899718 m, 24368 m/sec, 3616307 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1734 17/32 ShieldRVt-PT-050B-LTLFireability-07 1024785 m, 25013 m/sec, 4208995 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1734 18/32 ShieldRVt-PT-050B-LTLFireability-07 1147497 m, 24542 m/sec, 4795122 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1734 19/32 ShieldRVt-PT-050B-LTLFireability-07 1258079 m, 22116 m/sec, 5380521 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1734 20/32 ShieldRVt-PT-050B-LTLFireability-07 1353310 m, 19046 m/sec, 5929836 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1734 21/32 ShieldRVt-PT-050B-LTLFireability-07 1454553 m, 20248 m/sec, 6447424 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1734 22/32 ShieldRVt-PT-050B-LTLFireability-07 1557480 m, 20585 m/sec, 6961738 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1734 23/32 ShieldRVt-PT-050B-LTLFireability-07 1659549 m, 20413 m/sec, 7470819 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/1734 24/32 ShieldRVt-PT-050B-LTLFireability-07 1772163 m, 22522 m/sec, 7989714 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/1734 26/32 ShieldRVt-PT-050B-LTLFireability-07 1881535 m, 21874 m/sec, 8511199 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/1734 27/32 ShieldRVt-PT-050B-LTLFireability-07 1992485 m, 22190 m/sec, 9037491 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/1734 28/32 ShieldRVt-PT-050B-LTLFireability-07 2097126 m, 20928 m/sec, 9576729 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 95/1734 29/32 ShieldRVt-PT-050B-LTLFireability-07 2191836 m, 18942 m/sec, 10124556 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 100/1734 30/32 ShieldRVt-PT-050B-LTLFireability-07 2286643 m, 18961 m/sec, 10627730 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 105/1734 31/32 ShieldRVt-PT-050B-LTLFireability-07 2387445 m, 20160 m/sec, 11127803 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 110/1734 32/32 ShieldRVt-PT-050B-LTLFireability-07 2486817 m, 19874 m/sec, 11622962 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldRVt-PT-050B-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVt-PT-050B-LTLFireability-06
lola: time limit : 3354 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3354 11/32 ShieldRVt-PT-050B-LTLFireability-06 951815 m, 190363 m/sec, 1641056 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3354 21/32 ShieldRVt-PT-050B-LTLFireability-06 1894783 m, 188593 m/sec, 3219326 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3354 30/32 ShieldRVt-PT-050B-LTLFireability-06 2691269 m, 159297 m/sec, 4699679 t fired, .

Time elapsed: 261 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldRVt-PT-050B-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-050B-LTLFireability-02: LTL unknown AGGR
ShieldRVt-PT-050B-LTLFireability-06: LTL unknown AGGR
ShieldRVt-PT-050B-LTLFireability-07: LTL unknown AGGR
ShieldRVt-PT-050B-LTLFireability-15: LTL unknown AGGR


Time elapsed: 266 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVt-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976600332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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