Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 489K May 10 09:34 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-040B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653080605917

Running Version 202205111006
[2022-05-20 21:03:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:03:27] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-20 21:03:27] [INFO ] Transformed 2003 places.
[2022-05-20 21:03:27] [INFO ] Transformed 2003 transitions.
[2022-05-20 21:03:27] [INFO ] Found NUPN structural information;
[2022-05-20 21:03:27] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 425 places :
Symmetric choice reduction at 0 with 425 rule applications. Total rules 425 place count 1578 transition count 1578
Iterating global reduction 0 with 425 rules applied. Total rules applied 850 place count 1578 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 851 place count 1577 transition count 1577
Iterating global reduction 0 with 1 rules applied. Total rules applied 852 place count 1577 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 853 place count 1576 transition count 1576
Iterating global reduction 0 with 1 rules applied. Total rules applied 854 place count 1576 transition count 1576
Applied a total of 854 rules in 658 ms. Remains 1576 /2003 variables (removed 427) and now considering 1576/2003 (removed 427) transitions.
// Phase 1: matrix 1576 rows 1576 cols
[2022-05-20 21:03:28] [INFO ] Computed 161 place invariants in 37 ms
[2022-05-20 21:03:28] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 1576 rows 1576 cols
[2022-05-20 21:03:28] [INFO ] Computed 161 place invariants in 9 ms
[2022-05-20 21:03:29] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
// Phase 1: matrix 1576 rows 1576 cols
[2022-05-20 21:03:29] [INFO ] Computed 161 place invariants in 13 ms
[2022-05-20 21:03:30] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1576/2003 places, 1576/2003 transitions.
Finished structural reductions, in 1 iterations. Remains : 1576/2003 places, 1576/2003 transitions.
Support contains 40 out of 1576 places after structural reductions.
[2022-05-20 21:03:31] [INFO ] Flatten gal took : 125 ms
[2022-05-20 21:03:31] [INFO ] Flatten gal took : 75 ms
[2022-05-20 21:03:31] [INFO ] Input system was already deterministic with 1576 transitions.
Support contains 39 out of 1576 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 33) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1576 rows 1576 cols
[2022-05-20 21:03:31] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 21:03:32] [INFO ] [Real]Absence check using 161 positive place invariants in 54 ms returned sat
[2022-05-20 21:03:34] [INFO ] After 2698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-20 21:03:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2022-05-20 21:03:37] [INFO ] After 1677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-20 21:03:37] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 5 ms to minimize.
[2022-05-20 21:03:37] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 2 ms to minimize.
[2022-05-20 21:03:38] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 1 ms to minimize.
[2022-05-20 21:03:38] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 2 ms to minimize.
[2022-05-20 21:03:38] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2022-05-20 21:03:39] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2022-05-20 21:03:39] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 1 ms to minimize.
[2022-05-20 21:03:39] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 2 ms to minimize.
[2022-05-20 21:03:40] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 1 ms to minimize.
[2022-05-20 21:03:40] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 0 ms to minimize.
[2022-05-20 21:03:40] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2022-05-20 21:03:40] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 0 ms to minimize.
[2022-05-20 21:03:41] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 1 ms to minimize.
[2022-05-20 21:03:41] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 1 ms to minimize.
[2022-05-20 21:03:41] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2022-05-20 21:03:41] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2022-05-20 21:03:42] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 0 ms to minimize.
[2022-05-20 21:03:42] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 0 ms to minimize.
[2022-05-20 21:03:42] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 1 ms to minimize.
[2022-05-20 21:03:42] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2022-05-20 21:03:43] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 0 ms to minimize.
[2022-05-20 21:03:43] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 0 ms to minimize.
[2022-05-20 21:03:43] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 1 ms to minimize.
[2022-05-20 21:03:43] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 0 ms to minimize.
[2022-05-20 21:03:43] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6537 ms
[2022-05-20 21:03:44] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2022-05-20 21:03:44] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 0 ms to minimize.
[2022-05-20 21:03:44] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 1 ms to minimize.
[2022-05-20 21:03:44] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 1 ms to minimize.
[2022-05-20 21:03:45] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 0 ms to minimize.
[2022-05-20 21:03:45] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 1 ms to minimize.
[2022-05-20 21:03:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1502 ms
[2022-05-20 21:03:45] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 1 ms to minimize.
[2022-05-20 21:03:46] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 0 ms to minimize.
[2022-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2022-05-20 21:03:46] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2022-05-20 21:03:46] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 2 ms to minimize.
[2022-05-20 21:03:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1250 ms
[2022-05-20 21:03:47] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 0 ms to minimize.
[2022-05-20 21:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2022-05-20 21:03:47] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 1 ms to minimize.
[2022-05-20 21:03:47] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 0 ms to minimize.
[2022-05-20 21:03:48] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 0 ms to minimize.
[2022-05-20 21:03:48] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 1 ms to minimize.
[2022-05-20 21:03:48] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 1 ms to minimize.
[2022-05-20 21:03:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1284 ms
[2022-05-20 21:03:48] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2022-05-20 21:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2022-05-20 21:03:49] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 1 ms to minimize.
[2022-05-20 21:03:49] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 1 ms to minimize.
[2022-05-20 21:03:49] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2022-05-20 21:03:50] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2022-05-20 21:03:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1058 ms
[2022-05-20 21:03:50] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 0 ms to minimize.
[2022-05-20 21:03:50] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2022-05-20 21:03:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2022-05-20 21:03:51] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2022-05-20 21:03:51] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2022-05-20 21:03:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2022-05-20 21:03:52] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 0 ms to minimize.
[2022-05-20 21:03:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-20 21:03:52] [INFO ] After 16864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1349 ms.
[2022-05-20 21:03:53] [INFO ] After 19235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 629 ms.
Support contains 20 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 1576 transition count 1159
Reduce places removed 417 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 422 rules applied. Total rules applied 839 place count 1159 transition count 1154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 844 place count 1154 transition count 1154
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 308 Pre rules applied. Total rules applied 844 place count 1154 transition count 846
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 1460 place count 846 transition count 846
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1469 place count 837 transition count 837
Iterating global reduction 3 with 9 rules applied. Total rules applied 1478 place count 837 transition count 837
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1478 place count 837 transition count 829
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1494 place count 829 transition count 829
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Deduced a syphon composed of 363 places in 1 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 2220 place count 466 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 466 transition count 465
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 2223 place count 465 transition count 464
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -90
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 2425 place count 364 transition count 554
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2445 place count 354 transition count 564
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2446 place count 354 transition count 563
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2447 place count 354 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2448 place count 353 transition count 562
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2449 place count 353 transition count 561
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2450 place count 353 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2451 place count 352 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2452 place count 351 transition count 560
Applied a total of 2452 rules in 341 ms. Remains 351 /1576 variables (removed 1225) and now considering 560/1576 (removed 1016) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/1576 places, 560/1576 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) 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 13) 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 13) 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 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) 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 11) 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 11) seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 560 rows 351 cols
[2022-05-20 21:03:55] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:03:55] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2022-05-20 21:03:56] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 21:03:56] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2022-05-20 21:03:56] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 21:03:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 21:03:56] [INFO ] After 196ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 21:03:57] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-20 21:03:57] [INFO ] After 1078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 196 ms.
Support contains 12 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 560/560 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 351 transition count 556
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 347 transition count 556
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 347 transition count 553
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 344 transition count 553
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 342 transition count 551
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
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 24 place count 339 transition count 556
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 339 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 338 transition count 555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 337 transition count 554
Applied a total of 27 rules in 79 ms. Remains 337 /351 variables (removed 14) and now considering 554/560 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/351 places, 554/560 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) 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 9) 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 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 52 ms. (steps per millisecond=192 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 129269 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129269 steps, saw 82853 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 554 rows 337 cols
[2022-05-20 21:04:01] [INFO ] Computed 160 place invariants in 4 ms
[2022-05-20 21:04:01] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2022-05-20 21:04:01] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 21:04:01] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2022-05-20 21:04:02] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 21:04:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:04:02] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 21:04:02] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-20 21:04:02] [INFO ] After 1012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 12 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 554/554 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 554/554 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 554/554 transitions.
Applied a total of 0 rules in 9 ms. Remains 337 /337 variables (removed 0) and now considering 554/554 (removed 0) transitions.
// Phase 1: matrix 554 rows 337 cols
[2022-05-20 21:04:03] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:04:03] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 554 rows 337 cols
[2022-05-20 21:04:03] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:04:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:04:03] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2022-05-20 21:04:03] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 554 rows 337 cols
[2022-05-20 21:04:03] [INFO ] Computed 160 place invariants in 3 ms
[2022-05-20 21:04:03] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 554/554 transitions.
Graph (trivial) has 143 edges and 337 vertex of which 4 / 337 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1137 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 140 edges and 331 vertex of which 4 / 331 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 329 transition count 545
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 139 edges and 327 vertex of which 6 / 327 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 324 transition count 536
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 137 edges and 321 vertex of which 8 / 321 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 317 transition count 525
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 313 vertex of which 8 / 313 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 309 transition count 511
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 305 vertex of which 8 / 305 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 301 transition count 497
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 297 vertex of which 8 / 297 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 293 transition count 483
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 289 vertex of which 8 / 289 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 285 transition count 469
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 117 edges and 281 vertex of which 8 / 281 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 277 transition count 455
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 113 edges and 273 vertex of which 8 / 273 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 269 transition count 441
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 265 vertex of which 8 / 265 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 261 transition count 427
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 105 edges and 257 vertex of which 8 / 257 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 253 transition count 413
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 101 edges and 249 vertex of which 8 / 249 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 245 transition count 399
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 97 edges and 241 vertex of which 6 / 241 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 238 transition count 385
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 93 edges and 235 vertex of which 4 / 235 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 239 place count 233 transition count 375
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 90 edges and 231 vertex of which 2 / 231 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 248 place count 230 transition count 369
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 15 with 5 rules applied. Total rules applied 253 place count 229 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 253 place count 229 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 256 place count 227 transition count 364
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 16 with 3 rules applied. Total rules applied 259 place count 225 transition count 363
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 87 edges and 225 vertex of which 2 / 225 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 263 place count 224 transition count 360
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 88 edges and 223 vertex of which 4 / 223 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 267 place count 221 transition count 358
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 86 edges and 219 vertex of which 4 / 219 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 18 with 8 rules applied. Total rules applied 275 place count 217 transition count 353
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 85 edges and 215 vertex of which 6 / 215 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 19 with 12 rules applied. Total rules applied 287 place count 212 transition count 344
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 83 edges and 209 vertex of which 8 / 209 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 15 rules applied. Total rules applied 302 place count 205 transition count 333
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 201 vertex of which 8 / 201 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 321 place count 197 transition count 319
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 193 vertex of which 8 / 193 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 340 place count 189 transition count 305
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 185 vertex of which 8 / 185 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 359 place count 181 transition count 291
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 177 vertex of which 6 / 177 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 378 place count 174 transition count 277
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 64 edges and 171 vertex of which 6 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 25 with 14 rules applied. Total rules applied 392 place count 168 transition count 267
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 61 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 26 with 16 rules applied. Total rules applied 408 place count 163 transition count 255
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 59 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 10 rules applied. Total rules applied 418 place count 159 transition count 248
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 57 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 28 with 10 rules applied. Total rules applied 428 place count 155 transition count 241
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 11 rules applied. Total rules applied 439 place count 153 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 441 place count 152 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 2 Pre rules applied. Total rules applied 441 place count 152 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 6 rules applied. Total rules applied 447 place count 148 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 447 place count 148 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 449 place count 147 transition count 228
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 452 place count 145 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 31 with 3 rules applied. Total rules applied 455 place count 145 transition count 224
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 32 with 12 rules applied. Total rules applied 467 place count 145 transition count 212
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 468 place count 145 transition count 212
Applied a total of 468 rules in 138 ms. Remains 145 /337 variables (removed 192) and now considering 212/554 (removed 342) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 212 rows 145 cols
[2022-05-20 21:04:04] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-20 21:04:04] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-20 21:04:04] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 21:04:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-20 21:04:04] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 21:04:04] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-20 21:04:04] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-05-20 21:04:04] [INFO ] Flatten gal took : 12 ms
[2022-05-20 21:04:04] [INFO ] Flatten gal took : 13 ms
[2022-05-20 21:04:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6283068595311598702.gal : 7 ms
[2022-05-20 21:04:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14850232188275767120.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5533548190005883536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6283068595311598702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14850232188275767120.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14850232188275767120.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :4 after 48
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :48 after 88
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :88 after 112
Reachability property AtomicPropp32 is true.
Reachability property AtomicPropp20 is true.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :112 after 125
Reachability property AtomicPropp11 is true.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :125 after 131
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :131 after 136
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :136 after 162
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :162 after 200
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :200 after 665
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :665 after 4196
Reachability property AtomicPropp29 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4196 after 1.49918e+06
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.49918e+06 after 1.97001e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.97001e+08 after 1.19928e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.19928e+11 after 4.80926e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.00858e+22,0.087157,6340,2,226,28,11743,7,0,796,11781,0
Total reachable state count : 10085757322300697346048

Verifying 9 reachability properties.
Reachability property AtomicPropp4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp4,8.69731e+10,0.08829,6340,2,185,28,11743,8,0,805,11781,0
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,589824,0.088843,6604,2,167,28,11743,9,0,807,11781,0
Reachability property AtomicPropp11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp11,8,0.08923,6604,2,149,28,11743,10,0,809,11781,0
Reachability property AtomicPropp14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp14,6.3036e+20,0.089577,6604,2,221,28,11743,11,0,811,11781,0
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,4096,0.090001,6604,2,159,28,11743,12,0,813,11781,0
Reachability property AtomicPropp22 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp22,1.87862e+13,0.09028,6604,2,194,28,11743,13,0,815,11781,0
Reachability property AtomicPropp23 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp23,6.15586e+17,0.090688,6604,2,210,28,11743,13,0,816,11781,0
Reachability property AtomicPropp29 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp29,24576,0.091067,6604,2,162,28,11743,14,0,818,11781,0
Reachability property AtomicPropp32 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp32,5.04288e+21,0.091427,6604,2,225,28,11743,15,0,822,11781,0
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(X(!(p0 U p1))))||X(G((X(p2) U p0))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1564 transition count 1564
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1564 transition count 1564
Applied a total of 24 rules in 95 ms. Remains 1564 /1576 variables (removed 12) and now considering 1564/1576 (removed 12) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2022-05-20 21:04:05] [INFO ] Computed 161 place invariants in 9 ms
[2022-05-20 21:04:05] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 1564 rows 1564 cols
[2022-05-20 21:04:05] [INFO ] Computed 161 place invariants in 9 ms
[2022-05-20 21:04:06] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
// Phase 1: matrix 1564 rows 1564 cols
[2022-05-20 21:04:06] [INFO ] Computed 161 place invariants in 10 ms
[2022-05-20 21:04:07] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1576 places, 1564/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1564/1576 places, 1564/1576 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s1411 1), p1:(EQ s1413 1), p2:(EQ s1372 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1036 ms.
Product exploration explored 100000 steps with 33333 reset in 939 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1564 stabilizing places and 479/1564 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR p0 p1))))
Knowledge based reduction with 6 factoid took 182 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-00 finished in 4956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(X(X(G(p1))))))))'
Support contains 4 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 96 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:10] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 21:04:10] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:10] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 21:04:11] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:11] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:04:12] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(NEQ s1085 1), p1:(AND (EQ s337 1) (EQ s346 1) (EQ s371 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-01 finished in 2720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 111 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:04:12] [INFO ] Computed 161 place invariants in 11 ms
[2022-05-20 21:04:13] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:04:13] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:04:14] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:04:14] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:04:15] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s912 1), p1:(EQ s1285 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]]
Product exploration explored 100000 steps with 2 reset in 386 ms.
Stack based approach found an accepted trace after 1369 steps with 0 reset with depth 1370 and stack size 118 in 15 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-02 finished in 2971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||F(p0)))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 1575 transition count 1142
Reduce places removed 433 places and 0 transitions.
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 1142 transition count 1142
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 866 place count 1142 transition count 827
Deduced a syphon composed of 315 places in 1 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1496 place count 827 transition count 827
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1509 place count 814 transition count 814
Iterating global reduction 2 with 13 rules applied. Total rules applied 1522 place count 814 transition count 814
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1522 place count 814 transition count 802
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1546 place count 802 transition count 802
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 2 with 716 rules applied. Total rules applied 2262 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 444 transition count 443
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 2265 place count 443 transition count 442
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 2467 place count 342 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2503 place count 324 transition count 559
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2505 place count 322 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2506 place count 321 transition count 557
Applied a total of 2506 rules in 153 ms. Remains 321 /1576 variables (removed 1255) and now considering 557/1576 (removed 1019) transitions.
// Phase 1: matrix 557 rows 321 cols
[2022-05-20 21:04:15] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:04:16] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 557 rows 321 cols
[2022-05-20 21:04:16] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:04:16] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2022-05-20 21:04:16] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 557 rows 321 cols
[2022-05-20 21:04:16] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 21:04:16] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/1576 places, 557/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 321/1576 places, 557/1576 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-03 finished in 891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1 U p2))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 432 place count 1575 transition count 1143
Reduce places removed 432 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 433 rules applied. Total rules applied 865 place count 1143 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 866 place count 1142 transition count 1142
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 866 place count 1142 transition count 827
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1496 place count 827 transition count 827
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1508 place count 815 transition count 815
Iterating global reduction 3 with 12 rules applied. Total rules applied 1520 place count 815 transition count 815
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1520 place count 815 transition count 805
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1540 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2258 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2259 place count 446 transition count 445
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 2261 place count 445 transition count 444
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 2463 place count 344 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2497 place count 327 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2499 place count 325 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2500 place count 324 transition count 556
Applied a total of 2500 rules in 143 ms. Remains 324 /1576 variables (removed 1252) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 324 cols
[2022-05-20 21:04:16] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:04:16] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 556 rows 324 cols
[2022-05-20 21:04:16] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:04:17] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2022-05-20 21:04:17] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 556 rows 324 cols
[2022-05-20 21:04:17] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:04:17] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1576 places, 556/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/1576 places, 556/1576 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s272 1), p1:(EQ s292 1), p0:(NEQ s309 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-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-04 finished in 965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U (X(X(X(p0))) U X(p1)))&&p2)))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 90 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:17] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 21:04:17] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:17] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:04:19] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:19] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 21:04:20] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, p0, (OR (NOT p2) p1), (OR (NOT p2) p1), (AND p0 p1), p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 4}]], initial=2, aps=[p0:(EQ s69 1), p2:(EQ s782 1), p1:(EQ s651 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-06 finished in 2817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1575 transition count 1144
Reduce places removed 431 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 432 rules applied. Total rules applied 863 place count 1144 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 864 place count 1143 transition count 1143
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 864 place count 1143 transition count 828
Deduced a syphon composed of 315 places in 1 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1494 place count 828 transition count 828
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 3 with 14 rules applied. Total rules applied 1522 place count 814 transition count 814
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1522 place count 814 transition count 801
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1548 place count 801 transition count 801
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2262 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2263 place count 444 transition count 443
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 2265 place count 443 transition count 442
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 2467 place count 342 transition count 542
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2501 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2503 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2504 place count 322 transition count 556
Applied a total of 2504 rules in 133 ms. Remains 322 /1576 variables (removed 1254) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:04:20] [INFO ] Computed 160 place invariants in 3 ms
[2022-05-20 21:04:20] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:04:20] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 21:04:20] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2022-05-20 21:04:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:04:20] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:04:21] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1576 places, 556/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/1576 places, 556/1576 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07 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:(EQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&X(F(X(X(p2))))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 90 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:21] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:04:21] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:21] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 21:04:23] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:23] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:04:23] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1187 1), p1:(EQ s1120 1), p2:(EQ s1120 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 908 reset in 280 ms.
Product exploration explored 100000 steps with 918 reset in 325 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 514 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Finished random walk after 249 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 680 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:26] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:04:27] [INFO ] [Real]Absence check using 161 positive place invariants in 124 ms returned sat
[2022-05-20 21:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:04:31] [INFO ] [Real]Absence check using state equation in 3829 ms returned sat
[2022-05-20 21:04:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:04:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 135 ms returned sat
[2022-05-20 21:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:04:36] [INFO ] [Nat]Absence check using state equation in 4450 ms returned sat
[2022-05-20 21:04:36] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 74 ms.
[2022-05-20 21:04:46] [INFO ] Deduced a trap composed of 12 places in 577 ms of which 7 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 21:04:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:04:46] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 21:04:47] [INFO ] [Real]Absence check using 161 positive place invariants in 124 ms returned sat
[2022-05-20 21:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:04:51] [INFO ] [Real]Absence check using state equation in 3734 ms returned sat
[2022-05-20 21:04:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:04:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 131 ms returned sat
[2022-05-20 21:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:04:56] [INFO ] [Nat]Absence check using state equation in 4296 ms returned sat
[2022-05-20 21:04:56] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 82 ms.
[2022-05-20 21:05:06] [INFO ] Deduced a trap composed of 12 places in 563 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 21:05:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 42 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:06] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:05:07] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:07] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:05:08] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:08] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 21:05:09] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1561/1561 places, 1561/1561 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 593 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Finished random walk after 190 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 615 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:11] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 21:05:11] [INFO ] [Real]Absence check using 161 positive place invariants in 121 ms returned sat
[2022-05-20 21:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:05:15] [INFO ] [Real]Absence check using state equation in 3828 ms returned sat
[2022-05-20 21:05:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:05:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 132 ms returned sat
[2022-05-20 21:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:05:20] [INFO ] [Nat]Absence check using state equation in 4149 ms returned sat
[2022-05-20 21:05:20] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 75 ms.
[2022-05-20 21:05:31] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 21:05:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:31] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 21:05:31] [INFO ] [Real]Absence check using 161 positive place invariants in 127 ms returned sat
[2022-05-20 21:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:05:35] [INFO ] [Real]Absence check using state equation in 3726 ms returned sat
[2022-05-20 21:05:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:05:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 132 ms returned sat
[2022-05-20 21:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:05:40] [INFO ] [Nat]Absence check using state equation in 4173 ms returned sat
[2022-05-20 21:05:40] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 68 ms.
[2022-05-20 21:05:51] [INFO ] Deduced a trap composed of 12 places in 536 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 21:05:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 909 reset in 291 ms.
Product exploration explored 100000 steps with 925 reset in 274 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Performed 439 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1561 transition count 1561
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 439 place count 1561 transition count 1721
Deduced a syphon composed of 599 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 599 place count 1561 transition count 1721
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1075 places in 1 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1075 place count 1561 transition count 1721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1076 place count 1561 transition count 1720
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1394 place count 1243 transition count 1402
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 1712 place count 1243 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1713 place count 1243 transition count 1402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1715 place count 1241 transition count 1400
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1717 place count 1241 transition count 1400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 857 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1818 place count 1241 transition count 2132
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1919 place count 1140 transition count 1930
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2020 place count 1140 transition count 1930
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2078 place count 1140 transition count 2345
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2136 place count 1082 transition count 2229
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2194 place count 1082 transition count 2229
Deduced a syphon composed of 756 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 2197 place count 1082 transition count 2226
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2197 rules in 837 ms. Remains 1082 /1561 variables (removed 479) and now considering 2226/1561 (removed -665) transitions.
[2022-05-20 21:05:53] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 2226 rows 1082 cols
[2022-05-20 21:05:53] [INFO ] Computed 161 place invariants in 15 ms
[2022-05-20 21:05:54] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1082/1561 places, 2226/1561 transitions.
Finished structural reductions, in 1 iterations. Remains : 1082/1561 places, 2226/1561 transitions.
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 6 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 92972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&G(F(X(p1)))))'
Support contains 6 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 429 place count 1575 transition count 1146
Reduce places removed 429 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 430 rules applied. Total rules applied 859 place count 1146 transition count 1145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 860 place count 1145 transition count 1145
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 860 place count 1145 transition count 832
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1486 place count 832 transition count 832
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1499 place count 819 transition count 819
Iterating global reduction 3 with 13 rules applied. Total rules applied 1512 place count 819 transition count 819
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1512 place count 819 transition count 807
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1536 place count 807 transition count 807
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2250 place count 450 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2251 place count 450 transition count 449
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 2253 place count 449 transition count 448
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 2455 place count 348 transition count 548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2489 place count 331 transition count 564
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2491 place count 329 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2492 place count 328 transition count 562
Applied a total of 2492 rules in 146 ms. Remains 328 /1576 variables (removed 1248) and now considering 562/1576 (removed 1014) transitions.
// Phase 1: matrix 562 rows 328 cols
[2022-05-20 21:05:54] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:54] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 562 rows 328 cols
[2022-05-20 21:05:54] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 21:05:54] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2022-05-20 21:05:54] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 562 rows 328 cols
[2022-05-20 21:05:54] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:55] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 328/1576 places, 562/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 328/1576 places, 562/1576 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s180 1) (EQ s262 1)), p1:(OR (EQ s293 1) (AND (EQ s115 1) (EQ s125 1) (EQ s132 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 958 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 94 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:05:55] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 21:05:55] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:05:55] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:05:56] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:05:56] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 21:05:57] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1492 1), p0:(EQ s143 1)], 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 0 reset in 380 ms.
Stuttering criterion allowed to conclude after 1736 steps with 0 reset in 8 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-10 finished in 2797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1575 transition count 1144
Reduce places removed 431 places and 0 transitions.
Iterating post reduction 1 with 431 rules applied. Total rules applied 862 place count 1144 transition count 1144
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 862 place count 1144 transition count 831
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1488 place count 831 transition count 831
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1502 place count 817 transition count 817
Iterating global reduction 2 with 14 rules applied. Total rules applied 1516 place count 817 transition count 817
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1516 place count 817 transition count 804
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1542 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2260 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2261 place count 445 transition count 444
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 2263 place count 444 transition count 443
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 2465 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 2497 place count 327 transition count 557
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2499 place count 325 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2500 place count 324 transition count 555
Applied a total of 2500 rules in 118 ms. Remains 324 /1576 variables (removed 1252) and now considering 555/1576 (removed 1021) transitions.
// Phase 1: matrix 555 rows 324 cols
[2022-05-20 21:05:58] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:58] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 555 rows 324 cols
[2022-05-20 21:05:58] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:58] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2022-05-20 21:05:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 555 rows 324 cols
[2022-05-20 21:05:58] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:58] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1576 places, 555/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/1576 places, 555/1576 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s111 1), p0:(NEQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 432 place count 1575 transition count 1143
Reduce places removed 432 places and 0 transitions.
Iterating post reduction 1 with 432 rules applied. Total rules applied 864 place count 1143 transition count 1143
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 864 place count 1143 transition count 828
Deduced a syphon composed of 315 places in 1 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1494 place count 828 transition count 828
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 2 with 14 rules applied. Total rules applied 1522 place count 814 transition count 814
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1522 place count 814 transition count 801
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1548 place count 801 transition count 801
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2262 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 444 transition count 443
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 2265 place count 443 transition count 442
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 2467 place count 342 transition count 542
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2501 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2503 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2504 place count 322 transition count 556
Applied a total of 2504 rules in 124 ms. Remains 322 /1576 variables (removed 1254) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:05:59] [INFO ] Computed 160 place invariants in 3 ms
[2022-05-20 21:05:59] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:05:59] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:05:59] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2022-05-20 21:05:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 556 rows 322 cols
[2022-05-20 21:05:59] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:05:59] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1576 places, 556/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/1576 places, 556/1576 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14672 steps with 0 reset in 80 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 966 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p1))||F(G(X(G(p2))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 92 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:05:59] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 21:06:00] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:06:00] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 21:06:01] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2022-05-20 21:06:01] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:06:02] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1362 0), p0:(EQ s833 0), p2:(EQ s1485 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Product exploration explored 100000 steps with 50000 reset in 1175 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-040B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 5286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(!(F(p1) U p2)&&F(p3))))'
Support contains 4 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 430 place count 1575 transition count 1145
Reduce places removed 430 places and 0 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 860 place count 1145 transition count 1145
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 860 place count 1145 transition count 831
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1488 place count 831 transition count 831
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1499 place count 820 transition count 820
Iterating global reduction 2 with 11 rules applied. Total rules applied 1510 place count 820 transition count 820
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1510 place count 820 transition count 809
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1532 place count 809 transition count 809
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 0 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 2254 place count 448 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 448 transition count 447
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 2257 place count 447 transition count 446
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 2459 place count 346 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2493 place count 329 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2495 place count 327 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2496 place count 326 transition count 558
Applied a total of 2496 rules in 135 ms. Remains 326 /1576 variables (removed 1250) and now considering 558/1576 (removed 1018) transitions.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:05] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:06:05] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:05] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 21:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:06:05] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2022-05-20 21:06:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:05] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:06] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1576 places, 558/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 326/1576 places, 558/1576 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), true, p2, (NOT p0), (NOT p3), (AND p2 p1), (AND p2 p1 (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) p2), p1, (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 p2), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 1}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 1}, { cond=(AND p0 p1), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s32 1), p2:(EQ s262 1), p1:(EQ s26 1), p3:(EQ s285 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 30 reset in 471 ms.
Product exploration explored 100000 steps with 29 reset in 520 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/326 stabilizing places and 2/558 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X p3), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 38 factoid took 2060 ms. Reduced automaton from 11 states, 41 edges and 4 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:09] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:09] [INFO ] [Real]Absence check using 160 positive place invariants in 31 ms returned sat
[2022-05-20 21:06:10] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 21:06:10] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2022-05-20 21:06:10] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 21:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:06:10] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 21:06:10] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-20 21:06:10] [INFO ] After 428ms 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 61 ms.
Support contains 2 out of 326 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 326/326 places, 558/558 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 326 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 325 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 324 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 323 transition count 555
Applied a total of 6 rules in 19 ms. Remains 323 /326 variables (removed 3) and now considering 555/558 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 323/326 places, 555/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Finished probabilistic random walk after 21406 steps, run visited all 3 properties in 378 ms. (steps per millisecond=56 )
Probabilistic random walk after 21406 steps, saw 12535 distinct states, run finished after 378 ms. (steps per millisecond=56 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X p3), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p2 p1)), (F p1), (F (AND p2 (NOT p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 38 factoid took 1862 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Stuttering acceptance computed with spot in 118 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Support contains 2 out of 326 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 326/326 places, 558/558 transitions.
Applied a total of 0 rules in 6 ms. Remains 326 /326 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:13] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 21:06:13] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:13] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 21:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:06:13] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:13] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:14] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 326/326 places, 558/558 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 p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 420 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:14] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:15] [INFO ] [Real]Absence check using 160 positive place invariants in 17 ms returned sat
[2022-05-20 21:06:15] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 21:06:15] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2022-05-20 21:06:15] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 21:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:06:15] [INFO ] After 57ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 21:06:15] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-20 21:06:15] [INFO ] After 456ms 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 68 ms.
Support contains 2 out of 326 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 326/326 places, 558/558 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 326 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 325 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 324 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 323 transition count 555
Applied a total of 6 rules in 18 ms. Remains 323 /326 variables (removed 3) and now considering 555/558 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 323/326 places, 555/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) 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 3) seen :0
Finished probabilistic random walk after 21406 steps, run visited all 3 properties in 301 ms. (steps per millisecond=71 )
Probabilistic random walk after 21406 steps, saw 12535 distinct states, run finished after 301 ms. (steps per millisecond=71 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (AND p2 (NOT p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 12 factoid took 631 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Stuttering acceptance computed with spot in 188 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Stuttering acceptance computed with spot in 156 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Product exploration explored 100000 steps with 29 reset in 462 ms.
Product exploration explored 100000 steps with 31 reset in 529 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 154 ms :[true, (AND p2 p1), p2, p1, (AND p2 p1)]
Support contains 2 out of 326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 326/326 places, 558/558 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 326 transition count 560
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 20 ms. Remains 326 /326 variables (removed 0) and now considering 560/558 (removed -2) transitions.
[2022-05-20 21:06:18] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 560 rows 326 cols
[2022-05-20 21:06:18] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:18] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/326 places, 560/558 transitions.
Finished structural reductions, in 1 iterations. Remains : 326/326 places, 560/558 transitions.
Product exploration explored 100000 steps with 26 reset in 429 ms.
Product exploration explored 100000 steps with 25 reset in 509 ms.
Built C files in :
/tmp/ltsmin17289530001536814549
[2022-05-20 21:06:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17289530001536814549
Running compilation step : cd /tmp/ltsmin17289530001536814549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 973 ms.
Running link step : cd /tmp/ltsmin17289530001536814549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17289530001536814549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13345991440443609689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 326 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 326/326 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 326 /326 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:34] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:35] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:35] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 21:06:35] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
// Phase 1: matrix 558 rows 326 cols
[2022-05-20 21:06:35] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 21:06:35] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 326/326 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin14271444864493516882
[2022-05-20 21:06:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14271444864493516882
Running compilation step : cd /tmp/ltsmin14271444864493516882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 945 ms.
Running link step : cd /tmp/ltsmin14271444864493516882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14271444864493516882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3844291654219252554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 21:06:50] [INFO ] Flatten gal took : 34 ms
[2022-05-20 21:06:50] [INFO ] Flatten gal took : 29 ms
[2022-05-20 21:06:50] [INFO ] Time to serialize gal into /tmp/LTL16296763492729867897.gal : 4 ms
[2022-05-20 21:06:50] [INFO ] Time to serialize properties into /tmp/LTL17271020194076774594.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16296763492729867897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17271020194076774594.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1629676...268
Read 1 LTL properties
Checking formula 0 : !(((G("(p214==1)"))||((!((F("(p195==1)"))U("(p1607==1)")))&&(F("(p1743==0)")))))
Formula 0 simplified : !(G"(p214==1)" | (!(F"(p195==1)" U "(p1607==1)") & F"(p1743==0)"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3.t29, t3.t30, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2022-05-20 21:07:06] [INFO ] Flatten gal took : 30 ms
[2022-05-20 21:07:06] [INFO ] Applying decomposition
[2022-05-20 21:07:06] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph199220030644003586.txt' '-o' '/tmp/graph199220030644003586.bin' '-w' '/tmp/graph199220030644003586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph199220030644003586.bin' '-l' '-1' '-v' '-w' '/tmp/graph199220030644003586.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:07:06] [INFO ] Decomposing Gal with order
[2022-05-20 21:07:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:07:06] [INFO ] Removed a total of 1078 redundant transitions.
[2022-05-20 21:07:06] [INFO ] Flatten gal took : 86 ms
[2022-05-20 21:07:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 476 labels/synchronizations in 17 ms.
[2022-05-20 21:07:06] [INFO ] Time to serialize gal into /tmp/LTL11400815535862717356.gal : 5 ms
[2022-05-20 21:07:06] [INFO ] Time to serialize properties into /tmp/LTL17930621287359349946.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11400815535862717356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17930621287359349946.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1140081...247
Read 1 LTL properties
Checking formula 0 : !(((G("(i0.u14.p214==1)"))||((!((F("(i0.u13.p195==1)"))U("(i9.u128.p1607==1)")))&&(F("(i10.u139.p1743==0)")))))
Formula 0 simplified : !(G"(i0.u14.p214==1)" | (!(F"(i0.u13.p195==1)" U "(i9.u128.p1607==1)") & F"(i10.u139.p1743==0)"))
Reverse transition relation is NOT exact ! Due to transitions i0.u13.t3.t29, i0.u13.t3.t30, i0.u14.t2, Intersection with reachable at each step enabled. (...202
Computing Next relation with stutter on 4.90389e+30 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
49 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.549529,47692,1,0,62202,111,2502,159867,150,228,49343
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 61935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 94 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:07:07] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 21:07:07] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:07:07] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 21:07:08] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2022-05-20 21:07:08] [INFO ] Computed 161 place invariants in 6 ms
[2022-05-20 21:07:09] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions, in 1 iterations. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s745 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 2396 ms.
All properties solved by simple procedures.
Total runtime 222472 ms.

BK_STOP 1653080829568

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-040B, 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 r222-tall-165286026101020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B 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 ;