MCC'2022- Execution of r222-tall-165286026201036

About the Execution of ITS-Tools for ShieldRVt-PT-050B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1863.163	387015.00	495810.00	1249.10	FFFFFTFFFFFFFFFF	normal

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-165286026201036.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-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Apr 30 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:00 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.3K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 09:02 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 614K 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-050B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083177786

Running Version 202205111006
[2022-05-20 21:46:18] [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:46:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:46:19] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-20 21:46:19] [INFO ] Transformed 2503 places.
[2022-05-20 21:46:19] [INFO ] Transformed 2503 transitions.
[2022-05-20 21:46:19] [INFO ] Found NUPN structural information;
[2022-05-20 21:46:19] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-050B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 532 places :
Symmetric choice reduction at 0 with 532 rule applications. Total rules 532 place count 1971 transition count 1971
Iterating global reduction 0 with 532 rules applied. Total rules applied 1064 place count 1971 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1065 place count 1970 transition count 1970
Iterating global reduction 0 with 1 rules applied. Total rules applied 1066 place count 1970 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1067 place count 1969 transition count 1969
Iterating global reduction 0 with 1 rules applied. Total rules applied 1068 place count 1969 transition count 1969
Applied a total of 1068 rules in 926 ms. Remains 1969 /2503 variables (removed 534) and now considering 1969/2503 (removed 534) transitions.
// Phase 1: matrix 1969 rows 1969 cols
[2022-05-20 21:46:20] [INFO ] Computed 201 place invariants in 31 ms
[2022-05-20 21:46:21] [INFO ] Implicit Places using invariants in 649 ms returned []
// Phase 1: matrix 1969 rows 1969 cols
[2022-05-20 21:46:21] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:46:22] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
// Phase 1: matrix 1969 rows 1969 cols
[2022-05-20 21:46:22] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:46:23] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1969/2503 places, 1969/2503 transitions.
Finished structural reductions, in 1 iterations. Remains : 1969/2503 places, 1969/2503 transitions.
Support contains 48 out of 1969 places after structural reductions.
[2022-05-20 21:46:23] [INFO ] Flatten gal took : 158 ms
[2022-05-20 21:46:23] [INFO ] Flatten gal took : 98 ms
[2022-05-20 21:46:24] [INFO ] Input system was already deterministic with 1969 transitions.
Support contains 47 out of 1969 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 40) seen :14
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 1969 rows 1969 cols
[2022-05-20 21:46:24] [INFO ] Computed 201 place invariants in 16 ms
[2022-05-20 21:46:25] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2022-05-20 21:46:26] [INFO ] After 1402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2022-05-20 21:46:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 77 ms returned sat
[2022-05-20 21:46:31] [INFO ] After 2966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2022-05-20 21:46:31] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 4 ms to minimize.
[2022-05-20 21:46:31] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 3 ms to minimize.
[2022-05-20 21:46:32] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 1 ms to minimize.
[2022-05-20 21:46:32] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 1 ms to minimize.
[2022-05-20 21:46:32] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 5 ms to minimize.
[2022-05-20 21:46:32] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 1 ms to minimize.
[2022-05-20 21:46:33] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 1 ms to minimize.
[2022-05-20 21:46:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2185 ms
[2022-05-20 21:46:33] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 0 ms to minimize.
[2022-05-20 21:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2022-05-20 21:46:34] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 1 ms to minimize.
[2022-05-20 21:46:34] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 0 ms to minimize.
[2022-05-20 21:46:34] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 1 ms to minimize.
[2022-05-20 21:46:34] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 1 ms to minimize.
[2022-05-20 21:46:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1132 ms
[2022-05-20 21:46:35] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2022-05-20 21:46:35] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2022-05-20 21:46:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 575 ms
[2022-05-20 21:46:36] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2022-05-20 21:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2022-05-20 21:46:36] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2022-05-20 21:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2022-05-20 21:46:37] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2022-05-20 21:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2022-05-20 21:46:38] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 2 ms to minimize.
[2022-05-20 21:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2022-05-20 21:46:39] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 0 ms to minimize.
[2022-05-20 21:46:39] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2022-05-20 21:46:40] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-20 21:46:40] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2022-05-20 21:46:40] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2022-05-20 21:46:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1199 ms
[2022-05-20 21:46:41] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 1 ms to minimize.
[2022-05-20 21:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2022-05-20 21:46:41] [INFO ] After 13130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 2460 ms.
[2022-05-20 21:46:43] [INFO ] After 17447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 1340 ms.
Support contains 33 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Drop transitions removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 526 rules applied. Total rules applied 526 place count 1969 transition count 1443
Reduce places removed 526 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 530 rules applied. Total rules applied 1056 place count 1443 transition count 1439
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1060 place count 1439 transition count 1439
Performed 385 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 385 Pre rules applied. Total rules applied 1060 place count 1439 transition count 1054
Deduced a syphon composed of 385 places in 2 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 3 with 770 rules applied. Total rules applied 1830 place count 1054 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1834 place count 1050 transition count 1050
Iterating global reduction 3 with 4 rules applied. Total rules applied 1838 place count 1050 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1838 place count 1050 transition count 1049
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1840 place count 1049 transition count 1049
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Deduced a syphon composed of 462 places in 1 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 2764 place count 587 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2765 place count 587 transition count 586
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 2767 place count 586 transition count 585
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -83
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 2969 place count 485 transition count 668
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 3043 place count 448 transition count 705
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3044 place count 448 transition count 704
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3046 place count 448 transition count 702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3048 place count 446 transition count 702
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3049 place count 446 transition count 701
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3051 place count 446 transition count 701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3052 place count 445 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3053 place count 444 transition count 700
Applied a total of 3053 rules in 379 ms. Remains 444 /1969 variables (removed 1525) and now considering 700/1969 (removed 1269) transitions.
Finished structural reductions, in 1 iterations. Remains : 444/1969 places, 700/1969 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 700 rows 444 cols
[2022-05-20 21:46:45] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:46:46] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-20 21:46:46] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-20 21:46:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2022-05-20 21:46:47] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-20 21:46:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 21:46:47] [INFO ] After 477ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2022-05-20 21:46:48] [INFO ] After 1229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 482 ms.
[2022-05-20 21:46:48] [INFO ] After 2715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 2 properties in 735 ms.
Support contains 24 out of 444 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 444/444 places, 700/700 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 443 transition count 699
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 443 transition count 694
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 438 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 437 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 437 transition count 693
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 435 transition count 691
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 433 transition count 695
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 433 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 432 transition count 694
Applied a total of 24 rules in 48 ms. Remains 432 /444 variables (removed 12) and now considering 694/700 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/444 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 127081 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127081 steps, saw 82840 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 694 rows 432 cols
[2022-05-20 21:46:53] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:46:53] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-20 21:46:53] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 21:46:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-20 21:46:54] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 21:46:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 21:46:54] [INFO ] After 434ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-20 21:46:55] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 431 ms.
[2022-05-20 21:46:55] [INFO ] After 2449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 5 properties in 559 ms.
Support contains 17 out of 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 694/694 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 432 transition count 691
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 429 transition count 691
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 0 with 4 rules applied. Total rules applied 10 place count 427 transition count 689
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 424 transition count 691
Applied a total of 16 rules in 26 ms. Remains 424 /432 variables (removed 8) and now considering 691/694 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 424/432 places, 691/694 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) 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 13) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) 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 :0
Interrupted probabilistic random walk after 123400 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123400 steps, saw 79690 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 691 rows 424 cols
[2022-05-20 21:47:00] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:47:00] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2022-05-20 21:47:01] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-20 21:47:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-20 21:47:01] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-20 21:47:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 21:47:02] [INFO ] After 309ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-20 21:47:02] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 310 ms.
[2022-05-20 21:47:03] [INFO ] After 1792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 226 ms.
Support contains 16 out of 424 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 424/424 places, 691/691 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 423 transition count 691
Applied a total of 2 rules in 16 ms. Remains 423 /424 variables (removed 1) and now considering 691/691 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/424 places, 691/691 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 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 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 129021 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 129021 steps, saw 82835 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 691 rows 423 cols
[2022-05-20 21:47:07] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:07] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-20 21:47:07] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 21:47:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-20 21:47:08] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 21:47:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 21:47:08] [INFO ] After 273ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-05-20 21:47:09] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 257 ms.
[2022-05-20 21:47:09] [INFO ] After 1664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 406 ms.
Support contains 16 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 691/691 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 691/691 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 691/691 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 691/691 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 691/691 (removed 0) transitions.
// Phase 1: matrix 691 rows 423 cols
[2022-05-20 21:47:10] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:10] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 691 rows 423 cols
[2022-05-20 21:47:10] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 21:47:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 21:47:10] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2022-05-20 21:47:10] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 691 rows 423 cols
[2022-05-20 21:47:10] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:47:11] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 691/691 transitions.
Graph (trivial) has 179 edges and 423 vertex of which 4 / 423 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1428 edges and 421 vertex of which 419 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 176 edges and 417 vertex of which 4 / 417 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 415 transition count 682
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 175 edges and 413 vertex of which 6 / 413 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 410 transition count 673
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 173 edges and 407 vertex of which 8 / 407 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 403 transition count 662
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 395 transition count 648
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 387 transition count 634
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 379 transition count 620
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 371 transition count 606
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 363 transition count 592
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 359 vertex of which 8 / 359 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 355 transition count 578
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 347 transition count 564
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 339 transition count 550
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 331 transition count 536
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 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 323 transition count 522
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 128 edges and 320 vertex of which 6 / 320 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 17 rules applied. Total rules applied 242 place count 317 transition count 509
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 125 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 16 rules applied. Total rules applied 258 place count 311 transition count 497
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 123 edges and 308 vertex of which 6 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 273 place count 305 transition count 486
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 121 edges and 302 vertex of which 8 / 302 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 15 rules applied. Total rules applied 288 place count 298 transition count 475
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 117 edges and 294 vertex of which 8 / 294 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 20 rules applied. Total rules applied 308 place count 290 transition count 460
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 286 vertex of which 8 / 286 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 327 place count 282 transition count 446
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 278 vertex of which 8 / 278 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 346 place count 274 transition count 432
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 270 vertex of which 8 / 270 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 365 place count 266 transition count 418
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 262 vertex of which 6 / 262 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 384 place count 259 transition count 404
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 97 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 14 rules applied. Total rules applied 398 place count 254 transition count 394
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 94 edges and 252 vertex of which 2 / 252 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 9 rules applied. Total rules applied 407 place count 251 transition count 388
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 24 with 5 rules applied. Total rules applied 412 place count 250 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 2 Pre rules applied. Total rules applied 412 place count 250 transition count 382
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 418 place count 246 transition count 382
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 4 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 424 place count 242 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 797 edges and 242 vertex of which 240 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 25 with 6 rules applied. Total rules applied 430 place count 240 transition count 374
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 431 place count 240 transition count 373
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 27 with 13 rules applied. Total rules applied 444 place count 240 transition count 360
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 445 place count 240 transition count 360
Applied a total of 445 rules in 106 ms. Remains 240 /423 variables (removed 183) and now considering 360/691 (removed 331) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 360 rows 240 cols
[2022-05-20 21:47:11] [INFO ] Computed 109 place invariants in 3 ms
[2022-05-20 21:47:11] [INFO ] [Real]Absence check using 109 positive place invariants in 12 ms returned sat
[2022-05-20 21:47:11] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 21:47:11] [INFO ] [Nat]Absence check using 109 positive place invariants in 18 ms returned sat
[2022-05-20 21:47:12] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 21:47:12] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-20 21:47:12] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2022-05-20 21:47:12] [INFO ] Flatten gal took : 23 ms
[2022-05-20 21:47:12] [INFO ] Flatten gal took : 18 ms
[2022-05-20 21:47:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6870488953455753069.gal : 8 ms
[2022-05-20 21:47:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10474734774405818413.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12199657830944112746;'/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/ReachabilityCardinality6870488953455753069.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10474734774405818413.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/ReachabilityCardinality10474734774405818413.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 22
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :22 after 46
Reachability property AtomicPropp32 is true.
Reachability property AtomicPropp23 is true.
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :46 after 67
Reachability property AtomicPropp31 is true.
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :67 after 78
Reachability property AtomicPropp29 is true.
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :78 after 96
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :96 after 115
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :115 after 145
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :145 after 270
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :270 after 1257
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1257 after 24603
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :24603 after 1.23863e+07
Reachability property AtomicPropp24 is true.
Reachability property AtomicPropp13 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.23863e+07 after 6.18475e+11
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6.18475e+11 after 4.55989e+16
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.55989e+16 after 3.58605e+22
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.58605e+22 after 2.25615e+29
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,2.12917e+36,0.162184,8336,2,372,31,20685,8,0,1332,19393,0
Total reachable state count : 2129166230552937754424286651000815616

Verifying 12 reachability properties.
Reachability property AtomicPropp0 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
AtomicPropp0,2.24128e+21,0.163758,8600,2,319,31,20685,9,0,1335,19393,0
Reachability property AtomicPropp1 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
AtomicPropp1,2.43194e+17,0.1643,8600,2,305,31,20685,10,0,1337,19393,0
Reachability property AtomicPropp3 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
AtomicPropp3,8,0.164875,8600,2,244,31,20685,11,0,1339,19393,0
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,2.37495e+14,0.165436,8600,2,294,31,20685,12,0,1340,19393,0
Reachability property AtomicPropp6 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
AtomicPropp6,2.37495e+14,0.165967,8600,2,294,31,20685,12,0,1341,19393,0
Reachability property AtomicPropp13 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
AtomicPropp13,6.29146e+06,0.166552,8600,2,265,31,20685,13,0,1343,19393,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,7.29583e+17,0.167089,8600,2,307,31,20685,14,0,1345,19393,0
Reachability property AtomicPropp24 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
AtomicPropp24,1.03079e+11,0.167648,8600,2,282,31,20685,15,0,1347,19393,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,3072,0.167988,8600,2,253,31,20685,16,0,1349,19393,0
Reachability property AtomicPropp31 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
AtomicPropp31,2.57698e+10,0.168657,8600,2,279,31,20685,17,0,1351,19393,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,1.23695e+12,0.169086,8600,2,286,31,20685,18,0,1353,19393,0
Reachability property AtomicPropp37 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
AtomicPropp37,2.46431e+33,0.169784,8600,2,359,31,20685,18,0,1361,19393,0
Computed a total of 601 stabilizing places and 601 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X((p1&&(p2||F(p3)))))))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1954 transition count 1954
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1954 transition count 1954
Applied a total of 30 rules in 144 ms. Remains 1954 /1969 variables (removed 15) and now considering 1954/1969 (removed 15) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2022-05-20 21:47:13] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 21:47:13] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 1954 rows 1954 cols
[2022-05-20 21:47:13] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 21:47:15] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
// Phase 1: matrix 1954 rows 1954 cols
[2022-05-20 21:47:15] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 21:47:16] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1954/1969 places, 1954/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1954/1969 places, 1954/1969 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s651 1), p1:(NEQ s532 1), p2:(NEQ s1532 1), p3:(NEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33265 reset in 975 ms.
Product exploration explored 100000 steps with 33472 reset in 911 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 3 states, 5 edges and 4 AP.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132256 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132256 steps, saw 80523 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1954 rows 1954 cols
[2022-05-20 21:47:22] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 21:47:22] [INFO ] [Real]Absence check using 201 positive place invariants in 69 ms returned sat
[2022-05-20 21:47:22] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 21:47:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 71 ms returned sat
[2022-05-20 21:47:24] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 21:47:24] [INFO ] Deduced a trap composed of 34 places in 381 ms of which 1 ms to minimize.
[2022-05-20 21:47:25] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 1 ms to minimize.
[2022-05-20 21:47:25] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 1 ms to minimize.
[2022-05-20 21:47:26] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 1 ms to minimize.
[2022-05-20 21:47:26] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 1 ms to minimize.
[2022-05-20 21:47:26] [INFO ] Deduced a trap composed of 40 places in 362 ms of which 1 ms to minimize.
[2022-05-20 21:47:27] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2022-05-20 21:47:27] [INFO ] Deduced a trap composed of 21 places in 357 ms of which 1 ms to minimize.
[2022-05-20 21:47:28] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2022-05-20 21:47:28] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2022-05-20 21:47:28] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 1 ms to minimize.
[2022-05-20 21:47:29] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 1 ms to minimize.
[2022-05-20 21:47:29] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 1 ms to minimize.
[2022-05-20 21:47:30] [INFO ] Deduced a trap composed of 22 places in 324 ms of which 0 ms to minimize.
[2022-05-20 21:47:30] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 1 ms to minimize.
[2022-05-20 21:47:30] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 1 ms to minimize.
[2022-05-20 21:47:31] [INFO ] Deduced a trap composed of 48 places in 317 ms of which 1 ms to minimize.
[2022-05-20 21:47:31] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 3 ms to minimize.
[2022-05-20 21:47:32] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 1 ms to minimize.
[2022-05-20 21:47:32] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 1 ms to minimize.
[2022-05-20 21:47:32] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2022-05-20 21:47:33] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 1 ms to minimize.
[2022-05-20 21:47:33] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 1 ms to minimize.
[2022-05-20 21:47:33] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 0 ms to minimize.
[2022-05-20 21:47:34] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 2 ms to minimize.
[2022-05-20 21:47:34] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2022-05-20 21:47:34] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 1 ms to minimize.
[2022-05-20 21:47:35] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 1 ms to minimize.
[2022-05-20 21:47:35] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 0 ms to minimize.
[2022-05-20 21:47:35] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 0 ms to minimize.
[2022-05-20 21:47:35] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 1 ms to minimize.
[2022-05-20 21:47:36] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 0 ms to minimize.
[2022-05-20 21:47:36] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 0 ms to minimize.
[2022-05-20 21:47:36] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 1 ms to minimize.
[2022-05-20 21:47:37] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 1 ms to minimize.
[2022-05-20 21:47:37] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 0 ms to minimize.
[2022-05-20 21:47:37] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 13002 ms
[2022-05-20 21:47:37] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 2 ms to minimize.
[2022-05-20 21:47:38] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2022-05-20 21:47:38] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 2 ms to minimize.
[2022-05-20 21:47:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2022-05-20 21:47:38] [INFO ] After 15360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-05-20 21:47:38] [INFO ] After 16131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1954 transition count 1409
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1409 transition count 1408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1408 transition count 1408
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1092 place count 1408 transition count 1009
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1890 place count 1009 transition count 1009
Performed 453 Post agglomeration using F-continuation condition.Transition count delta: 453
Deduced a syphon composed of 453 places in 0 ms
Reduce places removed 453 places and 0 transitions.
Iterating global reduction 3 with 906 rules applied. Total rules applied 2796 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2797 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2799 place count 555 transition count 554
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 4 with 202 rules applied. Total rules applied 3001 place count 454 transition count 652
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3095 place count 407 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3096 place count 407 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3097 place count 406 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3098 place count 405 transition count 696
Applied a total of 3098 rules in 232 ms. Remains 405 /1954 variables (removed 1549) and now considering 696/1954 (removed 1258) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/1954 places, 696/1954 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 161891 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161891 steps, saw 103316 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 696 rows 405 cols
[2022-05-20 21:47:42] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:42] [INFO ] [Real]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-20 21:47:42] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 21:47:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-20 21:47:43] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 21:47:43] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-20 21:47:43] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 243 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 405/405 places, 696/696 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 405/405 places, 696/696 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 405/405 places, 696/696 transitions.
Applied a total of 0 rules in 9 ms. Remains 405 /405 variables (removed 0) and now considering 696/696 (removed 0) transitions.
// Phase 1: matrix 696 rows 405 cols
[2022-05-20 21:47:43] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-20 21:47:44] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 696 rows 405 cols
[2022-05-20 21:47:44] [INFO ] Computed 200 place invariants in 10 ms
[2022-05-20 21:47:44] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2022-05-20 21:47:44] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 696 rows 405 cols
[2022-05-20 21:47:44] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:44] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 405/405 places, 696/696 transitions.
Graph (trivial) has 196 edges and 405 vertex of which 4 / 405 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1389 edges and 403 vertex of which 401 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 193 edges and 399 vertex of which 4 / 399 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 397 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 192 edges and 395 vertex of which 6 / 395 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 392 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 190 edges and 389 vertex of which 8 / 389 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 385 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 381 vertex of which 8 / 381 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 377 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 373 vertex of which 8 / 373 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 369 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 365 vertex of which 8 / 365 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 361 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 357 vertex of which 8 / 357 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 353 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 349 vertex of which 8 / 349 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 345 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 341 vertex of which 8 / 341 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 337 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 333 vertex of which 8 / 333 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 329 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 325 vertex of which 6 / 325 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 322 transition count 555
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 155 edges and 319 vertex of which 6 / 319 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 14 rules applied. Total rules applied 201 place count 316 transition count 545
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 152 edges and 313 vertex of which 6 / 313 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 217 place count 310 transition count 533
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 150 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 232 place count 303 transition count 522
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 147 edges and 299 vertex of which 10 / 299 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 14 with 20 rules applied. Total rules applied 252 place count 294 transition count 507
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 141 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 15 with 24 rules applied. Total rules applied 276 place count 285 transition count 489
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 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 16 with 19 rules applied. Total rules applied 295 place count 277 transition count 475
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 273 vertex of which 8 / 273 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 314 place count 269 transition count 461
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 265 vertex of which 8 / 265 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 333 place count 261 transition count 447
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 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 19 with 19 rules applied. Total rules applied 352 place count 253 transition count 433
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 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 20 with 19 rules applied. Total rules applied 371 place count 245 transition count 419
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 241 vertex of which 8 / 241 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 390 place count 237 transition count 405
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 233 vertex of which 8 / 233 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 409 place count 229 transition count 391
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 225 vertex of which 8 / 225 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 428 place count 221 transition count 377
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 217 vertex of which 8 / 217 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 447 place count 213 transition count 363
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 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 25 with 19 rules applied. Total rules applied 466 place count 205 transition count 349
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 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 26 with 19 rules applied. Total rules applied 485 place count 197 transition count 335
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 93 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 27 with 19 rules applied. Total rules applied 504 place count 189 transition count 321
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 89 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 28 with 19 rules applied. Total rules applied 523 place count 181 transition count 307
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 85 edges and 177 vertex of which 8 / 177 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 542 place count 173 transition count 293
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 81 edges and 169 vertex of which 8 / 169 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 561 place count 165 transition count 279
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 77 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 580 place count 157 transition count 265
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 73 edges and 153 vertex of which 6 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 599 place count 150 transition count 251
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 69 edges and 147 vertex of which 4 / 147 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 33 with 14 rules applied. Total rules applied 613 place count 145 transition count 241
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 66 edges and 143 vertex of which 2 / 143 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 9 rules applied. Total rules applied 622 place count 142 transition count 235
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 35 with 5 rules applied. Total rules applied 627 place count 141 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 2 Pre rules applied. Total rules applied 627 place count 141 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 36 with 5 rules applied. Total rules applied 632 place count 138 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 6 rules applied. Total rules applied 638 place count 134 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 642 place count 134 transition count 223
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 37 with 2 rules applied. Total rules applied 644 place count 134 transition count 221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 645 place count 134 transition count 221
Applied a total of 645 rules in 58 ms. Remains 134 /405 variables (removed 271) and now considering 221/696 (removed 475) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 221 rows 134 cols
[2022-05-20 21:47:44] [INFO ] Computed 65 place invariants in 1 ms
[2022-05-20 21:47:44] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-20 21:47:44] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 21:47:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-20 21:47:44] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 21:47:45] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-20 21:47:45] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-20 21:47:45] [INFO ] Flatten gal took : 12 ms
[2022-05-20 21:47:45] [INFO ] Flatten gal took : 12 ms
[2022-05-20 21:47:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6602841588727944381.gal : 2 ms
[2022-05-20 21:47:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1216837801759693533.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15630403041355845103;'/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/ReachabilityCardinality6602841588727944381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1216837801759693533.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...319
Loading property file /tmp/ReachabilityCardinality1216837801759693533.prop.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 50
Reachability property apf3 is true.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :50 after 100
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :100 after 225
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :225 after 1224
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1224 after 18848
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18848 after 7.86432e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.86432e+07 after 1.68885e+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.66021e+20,0.069889,6088,2,204,17,9644,7,0,765,10217,0
Total reachable state count : 166020696663385964544

Verifying 4 reachability properties.
Reachability property apf0 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
apf0,1.03763e+19,0.07061,6088,2,199,17,9644,8,0,770,10217,0
Reachability property apf1 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
apf1,1.03763e+19,0.070966,6352,2,199,17,9644,8,0,770,10217,0
Reachability property apf2 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
apf2,1.38351e+19,0.071462,6352,2,199,17,9644,8,0,776,10217,0
Reachability property apf3 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
apf3,8,0.071642,6352,2,138,17,9644,9,0,776,10217,0
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 3 states, 5 edges and 4 AP to 3 states, 5 edges and 4 AP.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1953 transition count 1408
Reduce places removed 545 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 546 rules applied. Total rules applied 1091 place count 1408 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1092 place count 1407 transition count 1407
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1092 place count 1407 transition count 1008
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1890 place count 1008 transition count 1008
Performed 451 Post agglomeration using F-continuation condition.Transition count delta: 451
Deduced a syphon composed of 451 places in 0 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 3 with 902 rules applied. Total rules applied 2792 place count 557 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2793 place count 557 transition count 556
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2795 place count 556 transition count 555
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 4 with 202 rules applied. Total rules applied 2997 place count 455 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3091 place count 408 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3093 place count 406 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3094 place count 405 transition count 697
Applied a total of 3094 rules in 180 ms. Remains 405 /1954 variables (removed 1549) and now considering 697/1954 (removed 1257) transitions.
// Phase 1: matrix 697 rows 405 cols
[2022-05-20 21:47:45] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:46] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 697 rows 405 cols
[2022-05-20 21:47:46] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:46] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2022-05-20 21:47:46] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 697 rows 405 cols
[2022-05-20 21:47:46] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:46] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/1954 places, 697/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 405/1954 places, 697/1954 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p3), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X p3)), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 348 ms. Reduced automaton from 3 states, 5 edges and 4 AP to 3 states, 5 edges and 4 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Finished probabilistic random walk after 107073 steps, run visited all 4 properties in 1183 ms. (steps per millisecond=90 )
Probabilistic random walk after 107073 steps, saw 73562 distinct states, run finished after 1183 ms. (steps per millisecond=90 ) properties seen :4
Knowledge obtained : [(AND p1 p0 p2 p3), (X p3), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X p3)), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (AND p0 p1))), (F (AND (NOT p2) (NOT p3) p0 p1)), (F (OR (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND p0 p1)))
Knowledge based reduction with 10 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVt-PT-050B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-00 finished in 36017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((X((p0 U G(p0))) U (p1 U p2))&&p3))))'
Support contains 3 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1952 transition count 1952
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1952 transition count 1952
Applied a total of 34 rules in 150 ms. Remains 1952 /1969 variables (removed 17) and now considering 1952/1969 (removed 17) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:47:49] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:47:49] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:47:49] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 21:47:51] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:47:51] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 21:47:52] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1969 places, 1952/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1952/1969 places, 1952/1969 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s10 1), p2:(AND (EQ s449 1) (EQ s1452 1)), p1:(EQ s1452 1), p0:(EQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-01 finished in 3271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !G(F(p0))))))'
Support contains 1 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1968 transition count 1422
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1422 transition count 1422
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1092 place count 1422 transition count 1029
Deduced a syphon composed of 393 places in 2 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1878 place count 1029 transition count 1029
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1893 place count 1014 transition count 1014
Iterating global reduction 2 with 15 rules applied. Total rules applied 1908 place count 1014 transition count 1014
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1908 place count 1014 transition count 1002
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1932 place count 1002 transition count 1002
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2828 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2829 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2831 place count 553 transition count 552
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 3033 place count 452 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3129 place count 404 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3131 place count 402 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3132 place count 401 transition count 697
Applied a total of 3132 rules in 228 ms. Remains 401 /1969 variables (removed 1568) and now considering 697/1969 (removed 1272) transitions.
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:52] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:52] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:52] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:53] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2022-05-20 21:47:53] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:53] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:53] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/1969 places, 697/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/1969 places, 697/1969 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s260 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33 reset in 537 ms.
Product exploration explored 100000 steps with 23 reset in 697 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31459 steps, run visited all 1 properties in 279 ms. (steps per millisecond=112 )
Probabilistic random walk after 31459 steps, saw 20568 distinct states, run finished after 279 ms. (steps per millisecond=112 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 697/697 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 697/697 (removed 0) transitions.
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:55] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:55] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:55] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:47:56] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2022-05-20 21:47:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 697 rows 401 cols
[2022-05-20 21:47:56] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:47:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 697/697 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31459 steps, run visited all 1 properties in 269 ms. (steps per millisecond=116 )
Probabilistic random walk after 31459 steps, saw 20568 distinct states, run finished after 269 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering criterion allowed to conclude after 49974 steps with 13 reset in 244 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-02 finished in 5107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1953 transition count 1953
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1953 transition count 1953
Applied a total of 32 rules in 145 ms. Remains 1953 /1969 variables (removed 16) and now considering 1953/1969 (removed 16) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:47:57] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 21:47:57] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:47:58] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:47:59] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:47:59] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:48:00] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1969 places, 1953/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1953/1969 places, 1953/1969 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1064 0) (EQ s212 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 514 ms.
Product exploration explored 100000 steps with 0 reset in 732 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216753 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216753 steps, saw 113777 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:05] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:48:05] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:48:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2022-05-20 21:48:06] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:48:06] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2022-05-20 21:48:07] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 1 ms to minimize.
[2022-05-20 21:48:07] [INFO ] Deduced a trap composed of 26 places in 338 ms of which 1 ms to minimize.
[2022-05-20 21:48:08] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 1 ms to minimize.
[2022-05-20 21:48:08] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 1 ms to minimize.
[2022-05-20 21:48:09] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 0 ms to minimize.
[2022-05-20 21:48:09] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 1 ms to minimize.
[2022-05-20 21:48:09] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2022-05-20 21:48:10] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 1 ms to minimize.
[2022-05-20 21:48:10] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 1 ms to minimize.
[2022-05-20 21:48:10] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 1 ms to minimize.
[2022-05-20 21:48:11] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 1 ms to minimize.
[2022-05-20 21:48:11] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 1 ms to minimize.
[2022-05-20 21:48:11] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2022-05-20 21:48:12] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 1 ms to minimize.
[2022-05-20 21:48:12] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 0 ms to minimize.
[2022-05-20 21:48:12] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 1 ms to minimize.
[2022-05-20 21:48:13] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 0 ms to minimize.
[2022-05-20 21:48:13] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 0 ms to minimize.
[2022-05-20 21:48:13] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 1 ms to minimize.
[2022-05-20 21:48:14] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 0 ms to minimize.
[2022-05-20 21:48:14] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 0 ms to minimize.
[2022-05-20 21:48:14] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 1 ms to minimize.
[2022-05-20 21:48:14] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8111 ms
[2022-05-20 21:48:14] [INFO ] After 8977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-20 21:48:14] [INFO ] After 9334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1953 transition count 1405
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1405 transition count 1405
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1096 place count 1405 transition count 1006
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -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 3003 place count 452 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 699
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 697
Applied a total of 3102 rules in 173 ms. Remains 402 /1953 variables (removed 1551) and now considering 697/1953 (removed 1256) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/1953 places, 697/1953 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 146603 steps, run visited all 1 properties in 1114 ms. (steps per millisecond=131 )
Probabilistic random walk after 146603 steps, saw 92617 distinct states, run finished after 1114 ms. (steps per millisecond=131 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 85 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:16] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 21:48:16] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:17] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:48:18] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:18] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:48:19] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1953/1953 places, 1953/1953 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211458 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211458 steps, saw 112280 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:22] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:48:22] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:48:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 69 ms returned sat
[2022-05-20 21:48:24] [INFO ] After 819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:48:24] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2022-05-20 21:48:24] [INFO ] Deduced a trap composed of 22 places in 330 ms of which 1 ms to minimize.
[2022-05-20 21:48:25] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2022-05-20 21:48:25] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2022-05-20 21:48:26] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 1 ms to minimize.
[2022-05-20 21:48:26] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 0 ms to minimize.
[2022-05-20 21:48:26] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 1 ms to minimize.
[2022-05-20 21:48:27] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2022-05-20 21:48:27] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 1 ms to minimize.
[2022-05-20 21:48:27] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 0 ms to minimize.
[2022-05-20 21:48:28] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 1 ms to minimize.
[2022-05-20 21:48:28] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2022-05-20 21:48:28] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2022-05-20 21:48:29] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 0 ms to minimize.
[2022-05-20 21:48:29] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 0 ms to minimize.
[2022-05-20 21:48:29] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 0 ms to minimize.
[2022-05-20 21:48:29] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2022-05-20 21:48:30] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 1 ms to minimize.
[2022-05-20 21:48:30] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 1 ms to minimize.
[2022-05-20 21:48:30] [INFO ] Deduced a trap composed of 75 places in 242 ms of which 1 ms to minimize.
[2022-05-20 21:48:31] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 1 ms to minimize.
[2022-05-20 21:48:31] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 0 ms to minimize.
[2022-05-20 21:48:31] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 0 ms to minimize.
[2022-05-20 21:48:31] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7778 ms
[2022-05-20 21:48:31] [INFO ] After 8652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-20 21:48:31] [INFO ] After 9009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1953 transition count 1405
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1405 transition count 1405
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1096 place count 1405 transition count 1006
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -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 3003 place count 452 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 699
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 697
Applied a total of 3102 rules in 212 ms. Remains 402 /1953 variables (removed 1551) and now considering 697/1953 (removed 1256) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/1953 places, 697/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 146603 steps, run visited all 1 properties in 1044 ms. (steps per millisecond=140 )
Probabilistic random walk after 146603 steps, saw 92617 distinct states, run finished after 1045 ms. (steps per millisecond=140 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 475 ms.
Product exploration explored 100000 steps with 0 reset in 640 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1953 transition count 1953
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 548 place count 1953 transition count 2154
Deduced a syphon composed of 749 places in 3 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 749 place count 1953 transition count 2154
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1349 places in 2 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 1349 place count 1953 transition count 2154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1350 place count 1953 transition count 2153
Renaming transitions due to excessive name length > 1024 char.
Discarding 399 places :
Symmetric choice reduction at 2 with 399 rule applications. Total rules 1749 place count 1554 transition count 1754
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 399 rules applied. Total rules applied 2148 place count 1554 transition count 1754
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2149 place count 1554 transition count 1754
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2151 place count 1552 transition count 1752
Deduced a syphon composed of 949 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2153 place count 1552 transition count 1752
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1050 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2254 place count 1552 transition count 2484
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2355 place count 1451 transition count 2282
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2456 place count 1451 transition count 2282
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -698
Deduced a syphon composed of 1047 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2554 place count 1451 transition count 2980
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 2653 place count 1352 transition count 2782
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 2752 place count 1352 transition count 2782
Deduced a syphon composed of 948 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2755 place count 1352 transition count 2779
Deduced a syphon composed of 948 places in 1 ms
Applied a total of 2755 rules in 1267 ms. Remains 1352 /1953 variables (removed 601) and now considering 2779/1953 (removed -826) transitions.
[2022-05-20 21:48:36] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 2779 rows 1352 cols
[2022-05-20 21:48:36] [INFO ] Computed 201 place invariants in 22 ms
[2022-05-20 21:48:37] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1352/1953 places, 2779/1953 transitions.
Finished structural reductions, in 1 iterations. Remains : 1352/1953 places, 2779/1953 transitions.
Product exploration explored 100000 steps with 31 reset in 648 ms.
Product exploration explored 100000 steps with 24 reset in 714 ms.
Built C files in :
/tmp/ltsmin15162120754984285122
[2022-05-20 21:48:38] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15162120754984285122
Running compilation step : cd /tmp/ltsmin15162120754984285122;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15162120754984285122;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15162120754984285122;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 91 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:42] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:48:42] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:42] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:48:44] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:48:44] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:48:45] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1953/1953 places, 1953/1953 transitions.
Built C files in :
/tmp/ltsmin7864050838906196308
[2022-05-20 21:48:45] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7864050838906196308
Running compilation step : cd /tmp/ltsmin7864050838906196308;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7864050838906196308;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7864050838906196308;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 21:48:48] [INFO ] Flatten gal took : 60 ms
[2022-05-20 21:48:48] [INFO ] Flatten gal took : 55 ms
[2022-05-20 21:48:48] [INFO ] Time to serialize gal into /tmp/LTL13960682154854572643.gal : 9 ms
[2022-05-20 21:48:48] [INFO ] Time to serialize properties into /tmp/LTL10397685140496995986.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/LTL13960682154854572643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10397685140496995986.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/LTL1396068...268
Read 1 LTL properties
Checking formula 0 : !((G(X("((p1354==0)&&(p256==0))"))))
Formula 0 simplified : !GX"((p1354==0)&&(p256==0))"
Detected timeout of ITS tools.
[2022-05-20 21:49:03] [INFO ] Flatten gal took : 56 ms
[2022-05-20 21:49:03] [INFO ] Applying decomposition
[2022-05-20 21:49:03] [INFO ] Flatten gal took : 50 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/graph1037143838986350650.txt' '-o' '/tmp/graph1037143838986350650.bin' '-w' '/tmp/graph1037143838986350650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1037143838986350650.bin' '-l' '-1' '-v' '-w' '/tmp/graph1037143838986350650.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:49:03] [INFO ] Decomposing Gal with order
[2022-05-20 21:49:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:49:04] [INFO ] Removed a total of 501 redundant transitions.
[2022-05-20 21:49:04] [INFO ] Flatten gal took : 149 ms
[2022-05-20 21:49:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-20 21:49:04] [INFO ] Time to serialize gal into /tmp/LTL3478699027398709364.gal : 20 ms
[2022-05-20 21:49:04] [INFO ] Time to serialize properties into /tmp/LTL12480690577755836462.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/LTL3478699027398709364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12480690577755836462.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/LTL3478699...246
Read 1 LTL properties
Checking formula 0 : !((G(X("((i32.i3.u425.p1354==0)&&(i11.i1.u85.p256==0))"))))
Formula 0 simplified : !GX"((i32.i3.u425.p1354==0)&&(i11.i1.u85.p256==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11193825538568556939
[2022-05-20 21:49:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11193825538568556939
Running compilation step : cd /tmp/ltsmin11193825538568556939;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11193825538568556939;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11193825538568556939;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldRVt-PT-050B-LTLFireability-03 finished in 85072 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||F(p1))))))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1951 transition count 1951
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1951 transition count 1951
Applied a total of 36 rules in 197 ms. Remains 1951 /1969 variables (removed 18) and now considering 1951/1969 (removed 18) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:22] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 21:49:23] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:23] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:49:24] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:24] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:49:25] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1969 places, 1951/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1951/1969 places, 1951/1969 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s1240 0) (EQ s1278 0)), p0:(EQ s1278 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 662 ms.
Product exploration explored 100000 steps with 25000 reset in 691 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 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 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 153914 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153914 steps, saw 89894 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:30] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 21:49:31] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 21:49:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2022-05-20 21:49:32] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 21:49:33] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 1 ms to minimize.
[2022-05-20 21:49:33] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 1 ms to minimize.
[2022-05-20 21:49:34] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 1 ms to minimize.
[2022-05-20 21:49:34] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 1 ms to minimize.
[2022-05-20 21:49:34] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 0 ms to minimize.
[2022-05-20 21:49:35] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2022-05-20 21:49:35] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2022-05-20 21:49:36] [INFO ] Deduced a trap composed of 34 places in 353 ms of which 1 ms to minimize.
[2022-05-20 21:49:36] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 1 ms to minimize.
[2022-05-20 21:49:36] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 1 ms to minimize.
[2022-05-20 21:49:37] [INFO ] Deduced a trap composed of 22 places in 315 ms of which 1 ms to minimize.
[2022-05-20 21:49:37] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 1 ms to minimize.
[2022-05-20 21:49:38] [INFO ] Deduced a trap composed of 41 places in 318 ms of which 0 ms to minimize.
[2022-05-20 21:49:38] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 1 ms to minimize.
[2022-05-20 21:49:38] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 1 ms to minimize.
[2022-05-20 21:49:39] [INFO ] Deduced a trap composed of 50 places in 306 ms of which 0 ms to minimize.
[2022-05-20 21:49:39] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 1 ms to minimize.
[2022-05-20 21:49:39] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 0 ms to minimize.
[2022-05-20 21:49:40] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 1 ms to minimize.
[2022-05-20 21:49:40] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2022-05-20 21:49:40] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 1 ms to minimize.
[2022-05-20 21:49:41] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 1 ms to minimize.
[2022-05-20 21:49:41] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 1 ms to minimize.
[2022-05-20 21:49:41] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2022-05-20 21:49:42] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 1 ms to minimize.
[2022-05-20 21:49:42] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2022-05-20 21:49:42] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 1 ms to minimize.
[2022-05-20 21:49:43] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 1 ms to minimize.
[2022-05-20 21:49:43] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 1 ms to minimize.
[2022-05-20 21:49:43] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 0 ms to minimize.
[2022-05-20 21:49:44] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 1 ms to minimize.
[2022-05-20 21:49:44] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 1 ms to minimize.
[2022-05-20 21:49:44] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 1 ms to minimize.
[2022-05-20 21:49:45] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 1 ms to minimize.
[2022-05-20 21:49:45] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 1 ms to minimize.
[2022-05-20 21:49:45] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2022-05-20 21:49:46] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 1 ms to minimize.
[2022-05-20 21:49:46] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 1 ms to minimize.
[2022-05-20 21:49:46] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 1 ms to minimize.
[2022-05-20 21:49:46] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 0 ms to minimize.
[2022-05-20 21:49:47] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 0 ms to minimize.
[2022-05-20 21:49:47] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 0 ms to minimize.
[2022-05-20 21:49:47] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 1 ms to minimize.
[2022-05-20 21:49:47] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 1 ms to minimize.
[2022-05-20 21:49:48] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 1 ms to minimize.
[2022-05-20 21:49:48] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 1 ms to minimize.
[2022-05-20 21:49:48] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 1 ms to minimize.
[2022-05-20 21:49:48] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2022-05-20 21:49:49] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 16364 ms
[2022-05-20 21:49:49] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2022-05-20 21:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2022-05-20 21:49:49] [INFO ] After 17930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2022-05-20 21:49:49] [INFO ] After 18577ms 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 162 ms.
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1951 transition count 1406
Reduce places removed 545 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 547 rules applied. Total rules applied 1092 place count 1406 transition count 1404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1094 place count 1404 transition count 1404
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1094 place count 1404 transition count 1004
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1894 place count 1004 transition count 1004
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2794 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2797 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2999 place count 452 transition count 650
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3091 place count 406 transition count 696
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 406 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 405 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3094 place count 404 transition count 694
Applied a total of 3094 rules in 185 ms. Remains 404 /1951 variables (removed 1547) and now considering 694/1951 (removed 1257) transitions.
Finished structural reductions, in 1 iterations. Remains : 404/1951 places, 694/1951 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) 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 3) seen :0
Finished probabilistic random walk after 134578 steps, run visited all 3 properties in 1637 ms. (steps per millisecond=82 )
Probabilistic random walk after 134578 steps, saw 84392 distinct states, run finished after 1638 ms. (steps per millisecond=82 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Applied a total of 0 rules in 89 ms. Remains 1951 /1951 variables (removed 0) and now considering 1951/1951 (removed 0) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:52] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:49:53] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:53] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:49:54] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:54] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:49:55] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1951/1951 places, 1951/1951 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 149303 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149303 steps, saw 87968 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:49:59] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:49:59] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 21:49:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2022-05-20 21:50:01] [INFO ] After 993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 21:50:01] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 2 ms to minimize.
[2022-05-20 21:50:01] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2022-05-20 21:50:02] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 1 ms to minimize.
[2022-05-20 21:50:02] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 1 ms to minimize.
[2022-05-20 21:50:03] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 0 ms to minimize.
[2022-05-20 21:50:03] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 1 ms to minimize.
[2022-05-20 21:50:04] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 1 ms to minimize.
[2022-05-20 21:50:04] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 1 ms to minimize.
[2022-05-20 21:50:04] [INFO ] Deduced a trap composed of 40 places in 345 ms of which 1 ms to minimize.
[2022-05-20 21:50:05] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 1 ms to minimize.
[2022-05-20 21:50:05] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 1 ms to minimize.
[2022-05-20 21:50:06] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 1 ms to minimize.
[2022-05-20 21:50:06] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 1 ms to minimize.
[2022-05-20 21:50:06] [INFO ] Deduced a trap composed of 42 places in 334 ms of which 1 ms to minimize.
[2022-05-20 21:50:07] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 0 ms to minimize.
[2022-05-20 21:50:07] [INFO ] Deduced a trap composed of 50 places in 301 ms of which 0 ms to minimize.
[2022-05-20 21:50:07] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2022-05-20 21:50:08] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 0 ms to minimize.
[2022-05-20 21:50:08] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 1 ms to minimize.
[2022-05-20 21:50:09] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2022-05-20 21:50:09] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 2 ms to minimize.
[2022-05-20 21:50:09] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 1 ms to minimize.
[2022-05-20 21:50:10] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 0 ms to minimize.
[2022-05-20 21:50:10] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 1 ms to minimize.
[2022-05-20 21:50:10] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 1 ms to minimize.
[2022-05-20 21:50:11] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 1 ms to minimize.
[2022-05-20 21:50:11] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 1 ms to minimize.
[2022-05-20 21:50:11] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 1 ms to minimize.
[2022-05-20 21:50:12] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 0 ms to minimize.
[2022-05-20 21:50:12] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 1 ms to minimize.
[2022-05-20 21:50:12] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 1 ms to minimize.
[2022-05-20 21:50:12] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 0 ms to minimize.
[2022-05-20 21:50:13] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 1 ms to minimize.
[2022-05-20 21:50:13] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 0 ms to minimize.
[2022-05-20 21:50:13] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 1 ms to minimize.
[2022-05-20 21:50:14] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 1 ms to minimize.
[2022-05-20 21:50:14] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 1 ms to minimize.
[2022-05-20 21:50:14] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 1 ms to minimize.
[2022-05-20 21:50:15] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 1 ms to minimize.
[2022-05-20 21:50:15] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 1 ms to minimize.
[2022-05-20 21:50:15] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 1 ms to minimize.
[2022-05-20 21:50:15] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 0 ms to minimize.
[2022-05-20 21:50:16] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 0 ms to minimize.
[2022-05-20 21:50:16] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 1 ms to minimize.
[2022-05-20 21:50:16] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 0 ms to minimize.
[2022-05-20 21:50:16] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 1 ms to minimize.
[2022-05-20 21:50:17] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 0 ms to minimize.
[2022-05-20 21:50:17] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 1 ms to minimize.
[2022-05-20 21:50:17] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 16489 ms
[2022-05-20 21:50:17] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2022-05-20 21:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2022-05-20 21:50:18] [INFO ] After 18046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 218 ms.
[2022-05-20 21:50:18] [INFO ] After 18688ms 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 163 ms.
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1951 transition count 1406
Reduce places removed 545 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 547 rules applied. Total rules applied 1092 place count 1406 transition count 1404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1094 place count 1404 transition count 1404
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1094 place count 1404 transition count 1004
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1894 place count 1004 transition count 1004
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2794 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2797 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2999 place count 452 transition count 650
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3091 place count 406 transition count 696
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 406 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 405 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3094 place count 404 transition count 694
Applied a total of 3094 rules in 186 ms. Remains 404 /1951 variables (removed 1547) and now considering 694/1951 (removed 1257) transitions.
Finished structural reductions, in 1 iterations. Remains : 404/1951 places, 694/1951 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 404 cols
[2022-05-20 21:50:18] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:50:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:50:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-20 21:50:19] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:50:19] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-20 21:50:19] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1140 steps, including 38 resets, run visited all 1 properties in 8 ms. (steps per millisecond=142 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 694 ms.
Product exploration explored 100000 steps with 25000 reset in 694 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1951 transition count 1951
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 547 place count 1951 transition count 2151
Deduced a syphon composed of 749 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 749 place count 1951 transition count 2151
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1347 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1347 place count 1951 transition count 2151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1348 place count 1951 transition count 2150
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 1746 place count 1553 transition count 1752
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2144 place count 1553 transition count 1752
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2145 place count 1553 transition count 1752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2147 place count 1551 transition count 1750
Deduced a syphon composed of 948 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2149 place count 1551 transition count 1750
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1049 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2250 place count 1551 transition count 2482
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2351 place count 1450 transition count 2280
Deduced a syphon composed of 948 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2452 place count 1450 transition count 2280
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -679
Deduced a syphon composed of 1044 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2548 place count 1450 transition count 2959
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2644 place count 1354 transition count 2767
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2740 place count 1354 transition count 2767
Deduced a syphon composed of 948 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2743 place count 1354 transition count 2764
Deduced a syphon composed of 948 places in 0 ms
Applied a total of 2743 rules in 682 ms. Remains 1354 /1951 variables (removed 597) and now considering 2764/1951 (removed -813) transitions.
[2022-05-20 21:50:22] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 2764 rows 1354 cols
[2022-05-20 21:50:22] [INFO ] Computed 201 place invariants in 20 ms
[2022-05-20 21:50:23] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1354/1951 places, 2764/1951 transitions.
Finished structural reductions, in 1 iterations. Remains : 1354/1951 places, 2764/1951 transitions.
Product exploration explored 100000 steps with 25000 reset in 3440 ms.
Product exploration explored 100000 steps with 25000 reset in 3397 ms.
Built C files in :
/tmp/ltsmin10763058720238453043
[2022-05-20 21:50:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10763058720238453043
Running compilation step : cd /tmp/ltsmin10763058720238453043;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10763058720238453043;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10763058720238453043;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Applied a total of 0 rules in 77 ms. Remains 1951 /1951 variables (removed 0) and now considering 1951/1951 (removed 0) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:50:33] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:50:34] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:50:34] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:50:35] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:50:35] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:50:36] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1951/1951 places, 1951/1951 transitions.
Built C files in :
/tmp/ltsmin6084123877276958282
[2022-05-20 21:50:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6084123877276958282
Running compilation step : cd /tmp/ltsmin6084123877276958282;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6084123877276958282;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6084123877276958282;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 21:50:39] [INFO ] Flatten gal took : 62 ms
[2022-05-20 21:50:39] [INFO ] Flatten gal took : 45 ms
[2022-05-20 21:50:39] [INFO ] Time to serialize gal into /tmp/LTL17500427134475464427.gal : 6 ms
[2022-05-20 21:50:39] [INFO ] Time to serialize properties into /tmp/LTL4462766223682203454.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/LTL17500427134475464427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4462766223682203454.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/LTL1750042...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(p1631==1)"))||(F("((p1582==0)&&(p1631==0))")))))))
Formula 0 simplified : !XXX(G"(p1631==1)" | F"((p1582==0)&&(p1631==0))")
Detected timeout of ITS tools.
[2022-05-20 21:50:54] [INFO ] Flatten gal took : 41 ms
[2022-05-20 21:50:54] [INFO ] Applying decomposition
[2022-05-20 21:50:54] [INFO ] Flatten gal took : 40 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/graph5483686068257805614.txt' '-o' '/tmp/graph5483686068257805614.bin' '-w' '/tmp/graph5483686068257805614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5483686068257805614.bin' '-l' '-1' '-v' '-w' '/tmp/graph5483686068257805614.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:50:55] [INFO ] Decomposing Gal with order
[2022-05-20 21:50:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:50:55] [INFO ] Removed a total of 501 redundant transitions.
[2022-05-20 21:50:55] [INFO ] Flatten gal took : 96 ms
[2022-05-20 21:50:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 21:50:55] [INFO ] Time to serialize gal into /tmp/LTL8979987367720402182.gal : 17 ms
[2022-05-20 21:50:55] [INFO ] Time to serialize properties into /tmp/LTL6352848930105243223.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/LTL8979987367720402182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6352848930105243223.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/LTL8979987...245
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i34.i1.u504.p1631==1)"))||(F("((i33.i2.u490.p1582==0)&&(i34.i1.u504.p1631==0))")))))))
Formula 0 simplified : !XXX(G"(i34.i1.u504.p1631==1)" | F"((i33.i2.u490.p1582==0)&&(i34.i1.u504.p1631==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14020256718423861914
[2022-05-20 21:51:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14020256718423861914
Running compilation step : cd /tmp/ltsmin14020256718423861914;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14020256718423861914;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14020256718423861914;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldRVt-PT-050B-LTLFireability-05 finished in 110881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(X(p1) U p2))||G(p3)||p0)))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1952 transition count 1952
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1952 transition count 1952
Applied a total of 34 rules in 158 ms. Remains 1952 /1969 variables (removed 17) and now considering 1952/1969 (removed 17) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:13] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:51:13] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:13] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:15] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:15] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:51:16] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1969 places, 1952/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1952/1969 places, 1952/1969 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 p1), (NOT p3), (AND p2 p1 (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p3 p2), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p3 p2 p1), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(OR (EQ s1072 1) (EQ s751 1)), p3:(EQ s225 1), p2:(NEQ s751 1), p1:(EQ s254 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 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-06 finished in 3348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(!(X(G(X(X(F(p0))))) U p1))))))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1968 transition count 1424
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1088 place count 1424 transition count 1424
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1088 place count 1424 transition count 1031
Deduced a syphon composed of 393 places in 2 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1874 place count 1031 transition count 1031
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1890 place count 1015 transition count 1015
Iterating global reduction 2 with 16 rules applied. Total rules applied 1906 place count 1015 transition count 1015
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1906 place count 1015 transition count 1002
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 1932 place count 1002 transition count 1002
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2824 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2825 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2827 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3029 place count 454 transition count 654
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3123 place count 407 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3125 place count 405 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3126 place count 404 transition count 698
Applied a total of 3126 rules in 207 ms. Remains 404 /1969 variables (removed 1565) and now considering 698/1969 (removed 1271) transitions.
// Phase 1: matrix 698 rows 404 cols
[2022-05-20 21:51:16] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:51:17] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 698 rows 404 cols
[2022-05-20 21:51:17] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 21:51:17] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2022-05-20 21:51:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 698 rows 404 cols
[2022-05-20 21:51:17] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:18] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1969 places, 698/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/1969 places, 698/1969 transitions.
Stuttering acceptance computed with spot in 113 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s223 1), p0:(EQ s91 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 1461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&F(p1)&&X(p2)))))'
Support contains 3 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1968 transition count 1424
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1088 place count 1424 transition count 1424
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 392 Pre rules applied. Total rules applied 1088 place count 1424 transition count 1032
Deduced a syphon composed of 392 places in 1 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1872 place count 1032 transition count 1032
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1886 place count 1018 transition count 1018
Iterating global reduction 2 with 14 rules applied. Total rules applied 1900 place count 1018 transition count 1018
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1900 place count 1018 transition count 1006
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1924 place count 1006 transition count 1006
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2820 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2821 place count 558 transition count 557
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 2823 place count 557 transition count 556
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 3025 place count 456 transition count 656
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3121 place count 408 transition count 704
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3122 place count 408 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3124 place count 406 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3125 place count 405 transition count 702
Applied a total of 3125 rules in 218 ms. Remains 405 /1969 variables (removed 1564) and now considering 702/1969 (removed 1267) transitions.
// Phase 1: matrix 702 rows 405 cols
[2022-05-20 21:51:18] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:51:18] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 702 rows 405 cols
[2022-05-20 21:51:18] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 21:51:19] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2022-05-20 21:51:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 702 rows 405 cols
[2022-05-20 21:51:19] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/1969 places, 702/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 405/1969 places, 702/1969 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s326 1), p2:(EQ s271 1), p1:(EQ s212 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-08 finished in 1234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1) U G(!X(X(p2))))&&p0)))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1953 transition count 1953
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1953 transition count 1953
Applied a total of 32 rules in 155 ms. Remains 1953 /1969 variables (removed 16) and now considering 1953/1969 (removed 16) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:51:19] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:51:19] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:51:19] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:21] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
// Phase 1: matrix 1953 rows 1953 cols
[2022-05-20 21:51:21] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:22] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1969 places, 1953/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1953/1969 places, 1953/1969 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s1138 1) (EQ s1152 1)), p1:(EQ s1009 1), p2:(EQ s546 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-09 finished in 3389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&(p1 U (p2||G(p1))))) U (p3&&G((p0&&(p1 U (p2||G(p1)))))))))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1952 transition count 1952
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1952 transition count 1952
Applied a total of 34 rules in 153 ms. Remains 1952 /1969 variables (removed 17) and now considering 1952/1969 (removed 17) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:22] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:51:23] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:23] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:51:24] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:24] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:25] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1969 places, 1952/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1952/1969 places, 1952/1969 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p3 p0 p2) (AND p3 p0 p1)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s351 1), p2:(AND (NEQ s1540 1) (NEQ s740 1)), p1:(NEQ s740 1), p3:(EQ s843 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-10 finished in 3190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(((p1 U G(p2)) U X(p2)))))'
Support contains 3 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1951 transition count 1951
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1951 transition count 1951
Applied a total of 36 rules in 153 ms. Remains 1951 /1969 variables (removed 18) and now considering 1951/1969 (removed 18) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:26] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:51:26] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:26] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:28] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:28] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:28] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1969 places, 1951/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1951/1969 places, 1951/1969 transitions.
Stuttering acceptance computed with spot in 422 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 4}, { cond=p2, acceptance={0, 1} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=8 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=8 dest: 4}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=10 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=10 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=10 dest: 4}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(EQ s156 1), p0:(EQ s1837 1), p2:(EQ s1396 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 122 reset in 394 ms.
Stack based approach found an accepted trace after 5711 steps with 7 reset with depth 1009 and stack size 1009 in 25 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-11 finished in 3826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 1968 transition count 1423
Reduce places removed 545 places and 0 transitions.
Iterating post reduction 1 with 545 rules applied. Total rules applied 1090 place count 1423 transition count 1423
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1090 place count 1423 transition count 1030
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1876 place count 1030 transition count 1030
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1891 place count 1015 transition count 1015
Iterating global reduction 2 with 15 rules applied. Total rules applied 1906 place count 1015 transition count 1015
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1906 place count 1015 transition count 1003
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1930 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2826 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2827 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2829 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3031 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3125 place count 406 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3127 place count 404 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3128 place count 403 transition count 697
Applied a total of 3128 rules in 196 ms. Remains 403 /1969 variables (removed 1566) and now considering 697/1969 (removed 1272) transitions.
// Phase 1: matrix 697 rows 403 cols
[2022-05-20 21:51:30] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:30] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 697 rows 403 cols
[2022-05-20 21:51:30] [INFO ] Computed 200 place invariants in 0 ms
[2022-05-20 21:51:30] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2022-05-20 21:51:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 697 rows 403 cols
[2022-05-20 21:51:30] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:30] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1969 places, 697/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/1969 places, 697/1969 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s71 1), p1:(EQ s208 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-12 finished in 1191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||F(p2))))'
Support contains 5 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 1968 transition count 1425
Reduce places removed 543 places and 0 transitions.
Iterating post reduction 1 with 543 rules applied. Total rules applied 1086 place count 1425 transition count 1425
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1086 place count 1425 transition count 1032
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1872 place count 1032 transition count 1032
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1887 place count 1017 transition count 1017
Iterating global reduction 2 with 15 rules applied. Total rules applied 1902 place count 1017 transition count 1017
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1902 place count 1017 transition count 1006
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1924 place count 1006 transition count 1006
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2820 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2821 place count 558 transition count 557
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 2823 place count 557 transition count 556
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 3025 place count 456 transition count 655
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3119 place count 409 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3122 place count 406 transition count 699
Applied a total of 3122 rules in 192 ms. Remains 406 /1969 variables (removed 1563) and now considering 699/1969 (removed 1270) transitions.
// Phase 1: matrix 699 rows 406 cols
[2022-05-20 21:51:31] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 699 rows 406 cols
[2022-05-20 21:51:31] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:51:31] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2022-05-20 21:51:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 699 rows 406 cols
[2022-05-20 21:51:31] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:51:32] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1969 places, 699/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 406/1969 places, 699/1969 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s308 0) (EQ s318 0) (EQ s325 0)), p2:(EQ s353 1), p0:(EQ s168 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-13 finished in 1213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1951 transition count 1951
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1951 transition count 1951
Applied a total of 36 rules in 157 ms. Remains 1951 /1969 variables (removed 18) and now considering 1951/1969 (removed 18) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:32] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 21:51:32] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:32] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 21:51:34] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
// Phase 1: matrix 1951 rows 1951 cols
[2022-05-20 21:51:34] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:35] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1969 places, 1951/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1951/1969 places, 1951/1969 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1076 1) (EQ s308 1) (EQ s1031 1) (EQ s1040 1) (EQ s1065 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 449 ms.
Stack based approach found an accepted trace after 1958 steps with 0 reset with depth 1959 and stack size 1959 in 10 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-14 finished in 3525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p0))||p1))))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1952 transition count 1952
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1952 transition count 1952
Applied a total of 34 rules in 155 ms. Remains 1952 /1969 variables (removed 17) and now considering 1952/1969 (removed 17) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:35] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:51:36] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:36] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:37] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:37] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:51:38] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1969 places, 1952/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 1952/1969 places, 1952/1969 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1637 1), p0:(EQ s1327 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 298 reset in 306 ms.
Product exploration explored 100000 steps with 296 reset in 374 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/1952 stabilizing places and 599/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 488 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=162 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:51:40] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 21:51:41] [INFO ] [Real]Absence check using 201 positive place invariants in 209 ms returned sat
[2022-05-20 21:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:51:48] [INFO ] [Real]Absence check using state equation in 7037 ms returned sat
[2022-05-20 21:51:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:51:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 206 ms returned sat
[2022-05-20 21:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:51:56] [INFO ] [Nat]Absence check using state equation in 7790 ms returned sat
[2022-05-20 21:51:57] [INFO ] Computed and/alt/rep : 1951/2852/1951 causal constraints (skipped 0 transitions) in 91 ms.
[2022-05-20 21:52:04] [INFO ] Deduced a trap composed of 15 places in 814 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:686)
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:52:04] [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 (AND (NOT p1) (NOT p0))
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 71 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:52:04] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:52:04] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:52:04] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:52:06] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:52:06] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:52:07] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1952/1952 places, 1952/1952 transitions.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/1952 stabilizing places and 599/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 403 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 1952 rows 1952 cols
[2022-05-20 21:52:07] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 21:52:08] [INFO ] [Real]Absence check using 201 positive place invariants in 199 ms returned sat
[2022-05-20 21:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:52:15] [INFO ] [Real]Absence check using state equation in 6993 ms returned sat
[2022-05-20 21:52:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:52:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 211 ms returned sat
[2022-05-20 21:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:52:24] [INFO ] [Nat]Absence check using state equation in 7809 ms returned sat
[2022-05-20 21:52:24] [INFO ] Computed and/alt/rep : 1951/2852/1951 causal constraints (skipped 0 transitions) in 99 ms.
[2022-05-20 21:52:30] [INFO ] Added : 270 causal constraints over 54 iterations in 6220 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 295 reset in 299 ms.
Product exploration explored 100000 steps with 290 reset in 314 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1952
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 547 place count 1952 transition count 2152
Deduced a syphon composed of 747 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 747 place count 1952 transition count 2152
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1348 places in 2 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1348 place count 1952 transition count 2153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1349 place count 1952 transition count 2152
Renaming transitions due to excessive name length > 1024 char.
Discarding 400 places :
Symmetric choice reduction at 2 with 400 rule applications. Total rules 1749 place count 1552 transition count 1751
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 400 rules applied. Total rules applied 2149 place count 1552 transition count 1751
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2150 place count 1552 transition count 1751
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2152 place count 1550 transition count 1749
Deduced a syphon composed of 947 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2154 place count 1550 transition count 1749
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1048 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2255 place count 1550 transition count 2481
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2356 place count 1449 transition count 2279
Deduced a syphon composed of 947 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2457 place count 1449 transition count 2279
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -690
Deduced a syphon composed of 1043 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2553 place count 1449 transition count 2969
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2649 place count 1353 transition count 2777
Deduced a syphon composed of 947 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2745 place count 1353 transition count 2777
Deduced a syphon composed of 947 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2748 place count 1353 transition count 2774
Deduced a syphon composed of 947 places in 1 ms
Applied a total of 2748 rules in 683 ms. Remains 1353 /1952 variables (removed 599) and now considering 2774/1952 (removed -822) transitions.
[2022-05-20 21:52:32] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 2774 rows 1353 cols
[2022-05-20 21:52:32] [INFO ] Computed 201 place invariants in 16 ms
[2022-05-20 21:52:33] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1353/1952 places, 2774/1952 transitions.
Finished structural reductions, in 1 iterations. Remains : 1353/1952 places, 2774/1952 transitions.
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 57623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Found a SL insensitive property : ShieldRVt-PT-050B-LTLFireability-03
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1969/1969 places, 1969/1969 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1968 transition count 1422
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1422 transition count 1422
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1092 place count 1422 transition count 1029
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1878 place count 1029 transition count 1029
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1892 place count 1015 transition count 1015
Iterating global reduction 2 with 14 rules applied. Total rules applied 1906 place count 1015 transition count 1015
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1906 place count 1015 transition count 1004
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 1928 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 1 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2826 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2827 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2829 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3031 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3127 place count 405 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3129 place count 403 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3130 place count 402 transition count 698
Applied a total of 3130 rules in 205 ms. Remains 402 /1969 variables (removed 1567) and now considering 698/1969 (removed 1271) transitions.
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:33] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:52:33] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:33] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:52:34] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:34] [INFO ] Computed 200 place invariants in 0 ms
[2022-05-20 21:52:34] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 402/1969 places, 698/1969 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/1969 places, 698/1969 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s215 0) (EQ s34 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25 reset in 467 ms.
Product exploration explored 100000 steps with 26 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2541 steps, run visited all 1 properties in 26 ms. (steps per millisecond=97 )
Probabilistic random walk after 2541 steps, saw 1421 distinct states, run finished after 27 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 698/698 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:36] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:52:36] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:36] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:52:36] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:36] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:52:37] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 698/698 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2541 steps, run visited all 1 properties in 26 ms. (steps per millisecond=97 )
Probabilistic random walk after 2541 steps, saw 1421 distinct states, run finished after 26 ms. (steps per millisecond=97 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28 reset in 470 ms.
Product exploration explored 100000 steps with 30 reset in 575 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 698/698 transitions.
Applied a total of 0 rules in 16 ms. Remains 402 /402 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2022-05-20 21:52:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 698 rows 402 cols
[2022-05-20 21:52:39] [INFO ] Computed 200 place invariants in 0 ms
[2022-05-20 21:52:39] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 698/698 transitions.
Entered a terminal (fully accepting) state of product in 51782 steps with 19 reset in 243 ms.
Treatment of property ShieldRVt-PT-050B-LTLFireability-03 finished in 6272 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-03 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||F(p1))))))'
[2022-05-20 21:52:39] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6867906265860387760
[2022-05-20 21:52:39] [INFO ] Too many transitions (1969) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:52:39] [INFO ] Applying decomposition
[2022-05-20 21:52:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6867906265860387760
Running compilation step : cd /tmp/ltsmin6867906265860387760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-20 21:52:39] [INFO ] Flatten gal took : 42 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/graph16555660095734119568.txt' '-o' '/tmp/graph16555660095734119568.bin' '-w' '/tmp/graph16555660095734119568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16555660095734119568.bin' '-l' '-1' '-v' '-w' '/tmp/graph16555660095734119568.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:52:40] [INFO ] Decomposing Gal with order
[2022-05-20 21:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:52:40] [INFO ] Removed a total of 482 redundant transitions.
[2022-05-20 21:52:40] [INFO ] Flatten gal took : 82 ms
[2022-05-20 21:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 21:52:40] [INFO ] Time to serialize gal into /tmp/LTLFireability12734507767427109972.gal : 28 ms
[2022-05-20 21:52:40] [INFO ] Time to serialize properties into /tmp/LTLFireability11278808834009130651.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/LTLFireability12734507767427109972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11278808834009130651.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/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i3.i1.u510.p1631==1)"))||(F("((i35.i1.u495.p1582==0)&&(i3.i1.u510.p1631==0))")))))))
Formula 0 simplified : !XXX(G"(i3.i1.u510.p1631==1)" | F"((i35.i1.u495.p1582==0)&&(i3.i1.u510.p1631==0))")
Compilation finished in 3848 ms.
Running link step : cd /tmp/ltsmin6867906265860387760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6867906265860387760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([]((LTLAPp1==true))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 920 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 385802 ms.

BK_STOP 1653083564801

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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-050B"
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-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026201036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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