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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 01:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 01:01 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 21K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 1.3M 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-100B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084721831

Running Version 202205111006
[2022-05-20 22:12:02] [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 22:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:12:03] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-05-20 22:12:03] [INFO ] Transformed 5003 places.
[2022-05-20 22:12:03] [INFO ] Transformed 5003 transitions.
[2022-05-20 22:12:03] [INFO ] Found NUPN structural information;
[2022-05-20 22:12:03] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 435 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1088 places :
Symmetric choice reduction at 0 with 1088 rule applications. Total rules 1088 place count 3915 transition count 3915
Iterating global reduction 0 with 1088 rules applied. Total rules applied 2176 place count 3915 transition count 3915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2177 place count 3914 transition count 3914
Iterating global reduction 0 with 1 rules applied. Total rules applied 2178 place count 3914 transition count 3914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2179 place count 3913 transition count 3913
Iterating global reduction 0 with 1 rules applied. Total rules applied 2180 place count 3913 transition count 3913
Applied a total of 2180 rules in 2608 ms. Remains 3913 /5003 variables (removed 1090) and now considering 3913/5003 (removed 1090) transitions.
// Phase 1: matrix 3913 rows 3913 cols
[2022-05-20 22:12:06] [INFO ] Computed 401 place invariants in 39 ms
[2022-05-20 22:12:07] [INFO ] Implicit Places using invariants in 1035 ms returned []
// Phase 1: matrix 3913 rows 3913 cols
[2022-05-20 22:12:07] [INFO ] Computed 401 place invariants in 18 ms
[2022-05-20 22:12:08] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
// Phase 1: matrix 3913 rows 3913 cols
[2022-05-20 22:12:08] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 22:12:10] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3913/5003 places, 3913/5003 transitions.
Finished structural reductions, in 1 iterations. Remains : 3913/5003 places, 3913/5003 transitions.
Support contains 39 out of 3913 places after structural reductions.
[2022-05-20 22:12:11] [INFO ] Flatten gal took : 225 ms
[2022-05-20 22:12:11] [INFO ] Flatten gal took : 153 ms
[2022-05-20 22:12:11] [INFO ] Input system was already deterministic with 3913 transitions.
Support contains 38 out of 3913 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 33) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 3913 rows 3913 cols
[2022-05-20 22:12:12] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:12:13] [INFO ] [Real]Absence check using 401 positive place invariants in 221 ms returned sat
[2022-05-20 22:12:14] [INFO ] After 1738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-20 22:12:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 233 ms returned sat
[2022-05-20 22:12:22] [INFO ] After 5946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-20 22:12:23] [INFO ] Deduced a trap composed of 22 places in 865 ms of which 9 ms to minimize.
[2022-05-20 22:12:24] [INFO ] Deduced a trap composed of 23 places in 910 ms of which 7 ms to minimize.
[2022-05-20 22:12:25] [INFO ] Deduced a trap composed of 30 places in 880 ms of which 3 ms to minimize.
[2022-05-20 22:12:27] [INFO ] Deduced a trap composed of 24 places in 846 ms of which 3 ms to minimize.
[2022-05-20 22:12:28] [INFO ] Deduced a trap composed of 30 places in 839 ms of which 3 ms to minimize.
[2022-05-20 22:12:29] [INFO ] Deduced a trap composed of 22 places in 863 ms of which 2 ms to minimize.
[2022-05-20 22:12:30] [INFO ] Deduced a trap composed of 24 places in 842 ms of which 1 ms to minimize.
[2022-05-20 22:12:31] [INFO ] Deduced a trap composed of 20 places in 828 ms of which 2 ms to minimize.
[2022-05-20 22:12:32] [INFO ] Deduced a trap composed of 24 places in 817 ms of which 2 ms to minimize.
[2022-05-20 22:12:33] [INFO ] Deduced a trap composed of 54 places in 796 ms of which 1 ms to minimize.
[2022-05-20 22:12:33] [INFO ] Deduced a trap composed of 49 places in 781 ms of which 1 ms to minimize.
[2022-05-20 22:12:34] [INFO ] Deduced a trap composed of 48 places in 742 ms of which 2 ms to minimize.
[2022-05-20 22:12:35] [INFO ] Deduced a trap composed of 60 places in 794 ms of which 2 ms to minimize.
[2022-05-20 22:12:36] [INFO ] Deduced a trap composed of 46 places in 735 ms of which 2 ms to minimize.
[2022-05-20 22:12:37] [INFO ] Deduced a trap composed of 45 places in 780 ms of which 2 ms to minimize.
[2022-05-20 22:12:38] [INFO ] Deduced a trap composed of 55 places in 778 ms of which 2 ms to minimize.
[2022-05-20 22:12:39] [INFO ] Deduced a trap composed of 55 places in 725 ms of which 1 ms to minimize.
[2022-05-20 22:12:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 22:12:39] [INFO ] After 25146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 2200 ms.
Support contains 22 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Drop transitions removed 1082 transitions
Trivial Post-agglo rules discarded 1082 transitions
Performed 1082 trivial Post agglomeration. Transition count delta: 1082
Iterating post reduction 0 with 1082 rules applied. Total rules applied 1082 place count 3913 transition count 2831
Reduce places removed 1082 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 1088 rules applied. Total rules applied 2170 place count 2831 transition count 2825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 2176 place count 2825 transition count 2825
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 789 Pre rules applied. Total rules applied 2176 place count 2825 transition count 2036
Deduced a syphon composed of 789 places in 5 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 3754 place count 2036 transition count 2036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3759 place count 2031 transition count 2031
Iterating global reduction 3 with 5 rules applied. Total rules applied 3764 place count 2031 transition count 2031
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3764 place count 2031 transition count 2028
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3770 place count 2028 transition count 2028
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5572 place count 1127 transition count 1127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5573 place count 1127 transition count 1126
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5575 place count 1126 transition count 1125
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 4 with 202 rules applied. Total rules applied 5777 place count 1025 transition count 1224
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5979 place count 924 transition count 1317
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 6149 place count 839 transition count 1400
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6150 place count 839 transition count 1399
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 6152 place count 839 transition count 1397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 6154 place count 837 transition count 1397
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6155 place count 837 transition count 1396
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6156 place count 837 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6157 place count 836 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6158 place count 835 transition count 1395
Applied a total of 6158 rules in 1056 ms. Remains 835 /3913 variables (removed 3078) and now considering 1395/3913 (removed 2518) transitions.
Finished structural reductions, in 1 iterations. Remains : 835/3913 places, 1395/3913 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 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 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) 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 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 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 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 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 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 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 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 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 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 10 ms. (steps per millisecond=100 ) 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 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 103080 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103080 steps, saw 66342 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 1395 rows 835 cols
[2022-05-20 22:12:45] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:12:46] [INFO ] [Real]Absence check using 400 positive place invariants in 50 ms returned sat
[2022-05-20 22:12:46] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 22:12:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2022-05-20 22:12:48] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 22:12:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 22:12:48] [INFO ] After 725ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-20 22:12:49] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 703 ms.
[2022-05-20 22:12:50] [INFO ] After 4351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 813 ms.
Support contains 19 out of 835 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 835/835 places, 1395/1395 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 835 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 834 transition count 1394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 834 transition count 1392
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 6 place count 832 transition count 1392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 831 transition count 1394
Applied a total of 8 rules in 59 ms. Remains 831 /835 variables (removed 4) and now considering 1394/1395 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 831/835 places, 1394/1395 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 103600 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103600 steps, saw 64386 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 1394 rows 831 cols
[2022-05-20 22:12:54] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-20 22:12:55] [INFO ] [Real]Absence check using 400 positive place invariants in 51 ms returned sat
[2022-05-20 22:12:55] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-20 22:12:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 22:12:57] [INFO ] After 1065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-20 22:12:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 22:12:57] [INFO ] After 719ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-20 22:12:58] [INFO ] After 1872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 670 ms.
[2022-05-20 22:12:59] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 1315 ms.
Support contains 17 out of 831 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 831/831 places, 1394/1394 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 831 transition count 1393
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 830 transition count 1393
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 0 with 2 rules applied. Total rules applied 4 place count 829 transition count 1392
Applied a total of 4 rules in 50 ms. Remains 829 /831 variables (removed 2) and now considering 1392/1394 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 829/831 places, 1392/1394 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 109887 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109887 steps, saw 68398 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1392 rows 829 cols
[2022-05-20 22:13:04] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-20 22:13:04] [INFO ] [Real]Absence check using 400 positive place invariants in 51 ms returned sat
[2022-05-20 22:13:04] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-20 22:13:05] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2022-05-20 22:13:06] [INFO ] After 956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-20 22:13:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 22:13:06] [INFO ] After 595ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-20 22:13:07] [INFO ] After 1586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 578 ms.
[2022-05-20 22:13:08] [INFO ] After 3622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 673 ms.
Support contains 17 out of 829 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 829/829 places, 1392/1392 transitions.
Applied a total of 0 rules in 31 ms. Remains 829 /829 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 829/829 places, 1392/1392 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 829/829 places, 1392/1392 transitions.
Applied a total of 0 rules in 22 ms. Remains 829 /829 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
// Phase 1: matrix 1392 rows 829 cols
[2022-05-20 22:13:09] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:13:09] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 1392 rows 829 cols
[2022-05-20 22:13:09] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:13:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 22:13:10] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2022-05-20 22:13:10] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 1392 rows 829 cols
[2022-05-20 22:13:10] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:13:11] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 829/829 places, 1392/1392 transitions.
Graph (trivial) has 379 edges and 829 vertex of which 4 / 829 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2822 edges and 827 vertex of which 825 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 376 edges and 823 vertex of which 4 / 823 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 821 transition count 1383
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 375 edges and 819 vertex of which 6 / 819 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 816 transition count 1374
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 373 edges and 813 vertex of which 8 / 813 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 809 transition count 1363
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 369 edges and 805 vertex of which 8 / 805 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 801 transition count 1349
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 365 edges and 797 vertex of which 8 / 797 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 793 transition count 1335
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 361 edges and 789 vertex of which 8 / 789 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 785 transition count 1321
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 357 edges and 781 vertex of which 8 / 781 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 777 transition count 1307
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 353 edges and 773 vertex of which 8 / 773 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 769 transition count 1293
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 349 edges and 765 vertex of which 8 / 765 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 761 transition count 1279
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 345 edges and 757 vertex of which 8 / 757 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 753 transition count 1265
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 341 edges and 749 vertex of which 8 / 749 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 745 transition count 1251
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 337 edges and 741 vertex of which 8 / 741 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 737 transition count 1237
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 333 edges and 733 vertex of which 8 / 733 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 729 transition count 1223
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 329 edges and 725 vertex of which 8 / 725 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 721 transition count 1209
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 325 edges and 717 vertex of which 8 / 717 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 713 transition count 1195
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 321 edges and 709 vertex of which 8 / 709 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 705 transition count 1181
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 317 edges and 701 vertex of which 6 / 701 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 698 transition count 1167
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 315 edges and 695 vertex of which 8 / 695 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 15 rules applied. Total rules applied 316 place count 691 transition count 1156
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 311 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 20 rules applied. Total rules applied 336 place count 683 transition count 1141
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 307 edges and 679 vertex of which 8 / 679 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 355 place count 675 transition count 1127
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 303 edges and 671 vertex of which 8 / 671 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 374 place count 667 transition count 1113
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 299 edges and 663 vertex of which 8 / 663 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 393 place count 659 transition count 1099
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 295 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 651 transition count 1085
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 291 edges and 647 vertex of which 6 / 647 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 644 transition count 1071
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 287 edges and 641 vertex of which 4 / 641 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 14 rules applied. Total rules applied 445 place count 639 transition count 1061
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 284 edges and 637 vertex of which 2 / 637 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 25 with 9 rules applied. Total rules applied 454 place count 636 transition count 1055
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 26 with 5 rules applied. Total rules applied 459 place count 635 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 2 Pre rules applied. Total rules applied 459 place count 635 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 27 with 5 rules applied. Total rules applied 464 place count 632 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 3 rules applied. Total rules applied 467 place count 630 transition count 1048
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 3 rules applied. Total rules applied 470 place count 630 transition count 1045
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 28 with 7 rules applied. Total rules applied 477 place count 630 transition count 1038
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 478 place count 630 transition count 1038
Applied a total of 478 rules in 244 ms. Remains 630 /829 variables (removed 199) and now considering 1038/1392 (removed 354) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 1038 rows 630 cols
[2022-05-20 22:13:11] [INFO ] Computed 301 place invariants in 2 ms
[2022-05-20 22:13:11] [INFO ] [Real]Absence check using 301 positive place invariants in 33 ms returned sat
[2022-05-20 22:13:11] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-20 22:13:11] [INFO ] [Nat]Absence check using 301 positive place invariants in 34 ms returned sat
[2022-05-20 22:13:12] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-20 22:13:13] [INFO ] After 1481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 460 ms.
[2022-05-20 22:13:13] [INFO ] After 2305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2022-05-20 22:13:14] [INFO ] Flatten gal took : 55 ms
[2022-05-20 22:13:14] [INFO ] Flatten gal took : 37 ms
[2022-05-20 22:13:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4013838865908546968.gal : 24 ms
[2022-05-20 22:13:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7624223642637995117.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13433061504305086972;'/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/ReachabilityCardinality4013838865908546968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7624223642637995117.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/ReachabilityCardinality7624223642637995117.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 45
Reachability property AtomicPropp30 is true.
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :45 after 123
Reachability property AtomicPropp11 is true.
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :123 after 183
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :183 after 255
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :255 after 301
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :301 after 396
Reachability property AtomicPropp12 is true.
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :396 after 3994
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :3994 after 459157
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :459157 after 2.01327e+08
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2.01327e+08 after 2.8991e+10
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2.8991e+10 after 7.78222e+18
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :7.78222e+18 after 1.30846e+36
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp14 is true.
Detected timeout of ITS tools.
[2022-05-20 22:13:29] [INFO ] Flatten gal took : 37 ms
[2022-05-20 22:13:29] [INFO ] Applying decomposition
[2022-05-20 22:13:29] [INFO ] Flatten gal took : 37 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/graph7869651665512899608.txt' '-o' '/tmp/graph7869651665512899608.bin' '-w' '/tmp/graph7869651665512899608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7869651665512899608.bin' '-l' '-1' '-v' '-w' '/tmp/graph7869651665512899608.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:13:29] [INFO ] Decomposing Gal with order
[2022-05-20 22:13:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:13:29] [INFO ] Removed a total of 1078 redundant transitions.
[2022-05-20 22:13:29] [INFO ] Flatten gal took : 105 ms
[2022-05-20 22:13:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 22:13:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2569353067732766390.gal : 11 ms
[2022-05-20 22:13:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6994970118458046900.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13433061504305086972;'/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/ReachabilityCardinality2569353067732766390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6994970118458046900.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality6994970118458046900.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 3
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 18
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\_mod\_flat,8.448e+94,0.306926,14632,118,8,17492,166,1046,36917,47,297,0
Total reachable state count : 8.447995601054380696972497958971373109513e+94

Verifying 7 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.816e+94,0.310485,14632,119,10,17492,166,1046,36917,49,297,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.112e+94,0.310724,14632,120,9,17492,166,1046,36917,50,297,0
Reachability property AtomicPropp5 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
AtomicPropp5,2.112e+94,0.310913,14632,121,9,17492,166,1046,36917,51,297,0
Reachability property AtomicPropp8 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
AtomicPropp8,5.28e+93,0.311413,14632,119,9,17492,166,1047,36917,51,297,17
Reachability property AtomicPropp10 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
AtomicPropp10,2.112e+94,0.311591,14632,119,9,17492,166,1050,36917,51,297,17
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,2.816e+94,0.311769,14632,119,10,17492,166,1050,36917,51,297,17
Reachability property AtomicPropp21 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
AtomicPropp21,1.056e+94,0.311993,14632,120,10,17492,166,1051,36917,52,297,19
Computed a total of 1203 stabilizing places and 1203 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X((F(X((G(p0)&&p1)))&&F(p2)))))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1101 transitions
Trivial Post-agglo rules discarded 1101 transitions
Performed 1101 trivial Post agglomeration. Transition count delta: 1101
Iterating post reduction 0 with 1101 rules applied. Total rules applied 1101 place count 3912 transition count 2811
Reduce places removed 1101 places and 0 transitions.
Iterating post reduction 1 with 1101 rules applied. Total rules applied 2202 place count 2811 transition count 2811
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2202 place count 2811 transition count 2019
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3786 place count 2019 transition count 2019
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 3796 place count 2009 transition count 2009
Iterating global reduction 2 with 10 rules applied. Total rules applied 3806 place count 2009 transition count 2009
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3806 place count 2009 transition count 2001
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 3822 place count 2001 transition count 2001
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 1 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 5608 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 1108 transition count 1107
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 5611 place count 1107 transition count 1106
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 5813 place count 1006 transition count 1206
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 6015 place count 905 transition count 1306
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6207 place count 809 transition count 1402
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6208 place count 809 transition count 1402
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6210 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6211 place count 806 transition count 1400
Applied a total of 6211 rules in 608 ms. Remains 806 /3913 variables (removed 3107) and now considering 1400/3913 (removed 2513) transitions.
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:13:30] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:13:31] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:13:31] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:13:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 22:13:32] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2022-05-20 22:13:32] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:13:32] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 22:13:32] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3913 places, 1400/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 806/3913 places, 1400/3913 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s627 0), p1:(EQ s302 0), p0:(EQ s493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-00 finished in 2985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!F(G(!X(F(G(!G(p0)))))) U p1)))'
Support contains 2 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3901 transition count 3901
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3901 transition count 3901
Applied a total of 24 rules in 599 ms. Remains 3901 /3913 variables (removed 12) and now considering 3901/3913 (removed 12) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:33] [INFO ] Computed 401 place invariants in 11 ms
[2022-05-20 22:13:34] [INFO ] Implicit Places using invariants in 796 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:34] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:13:35] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:35] [INFO ] Computed 401 place invariants in 9 ms
[2022-05-20 22:13:37] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3913 places, 3901/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3901/3913 places, 3901/3913 transitions.
Stuttering acceptance computed with spot in 156 ms :[p1, p1, true, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1272 1), p0:(EQ s2193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36494 steps with 0 reset in 364 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 5111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(p0)) U !p1)&&((p1 U p2)||p1))))'
Support contains 4 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3901 transition count 3901
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3901 transition count 3901
Applied a total of 24 rules in 564 ms. Remains 3901 /3913 variables (removed 12) and now considering 3901/3913 (removed 12) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:38] [INFO ] Computed 401 place invariants in 17 ms
[2022-05-20 22:13:39] [INFO ] Implicit Places using invariants in 790 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:39] [INFO ] Computed 401 place invariants in 10 ms
[2022-05-20 22:13:40] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:41] [INFO ] Computed 401 place invariants in 14 ms
[2022-05-20 22:13:42] [INFO ] Dead Transitions using invariants and state equation in 1881 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3913 places, 3901/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3901/3913 places, 3901/3913 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (OR (NOT p2) p1), true, (OR (NOT p2) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s2315 1), p1:(AND (EQ s3314 1) (EQ s3328 1)), p2:(EQ s272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-02 finished in 4695 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 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 577 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:43] [INFO ] Computed 401 place invariants in 16 ms
[2022-05-20 22:13:44] [INFO ] Implicit Places using invariants in 794 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:44] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 22:13:45] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:45] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:13:47] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-04 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 s1839 1) (EQ s2129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-04 finished in 4942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&(X(p1) U (p1 U p2))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 539 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:48] [INFO ] Computed 401 place invariants in 24 ms
[2022-05-20 22:13:49] [INFO ] Implicit Places using invariants in 795 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:49] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 22:13:50] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:50] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 22:13:52] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 473 ms :[(NOT p2), (NOT p0), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(EQ s2448 1), p1:(EQ s2951 1), p0:(EQ s321 0)], 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, null][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-100B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-05 finished in 5057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(p1)&&p2))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3901 transition count 3901
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3901 transition count 3901
Applied a total of 24 rules in 552 ms. Remains 3901 /3913 variables (removed 12) and now considering 3901/3913 (removed 12) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:53] [INFO ] Computed 401 place invariants in 10 ms
[2022-05-20 22:13:54] [INFO ] Implicit Places using invariants in 795 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:54] [INFO ] Computed 401 place invariants in 14 ms
[2022-05-20 22:13:55] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:13:55] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:13:57] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3913 places, 3901/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3901/3913 places, 3901/3913 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p1:(EQ s2951 1), p2:(EQ s1469 0), p0:(EQ s357 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8983 steps with 0 reset in 77 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-07 finished in 4903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 556 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:58] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 22:13:59] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:13:59] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:14:00] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:00] [INFO ] Computed 401 place invariants in 17 ms
[2022-05-20 22:14:02] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2808 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2125 ms.
Product exploration explored 100000 steps with 50000 reset in 2167 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-100B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100B-LTLFireability-08 finished in 9073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)&&(X(G(p1))||p2)))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3904 transition count 3904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3904 transition count 3904
Applied a total of 18 rules in 541 ms. Remains 3904 /3913 variables (removed 9) and now considering 3904/3913 (removed 9) transitions.
// Phase 1: matrix 3904 rows 3904 cols
[2022-05-20 22:14:07] [INFO ] Computed 401 place invariants in 18 ms
[2022-05-20 22:14:08] [INFO ] Implicit Places using invariants in 825 ms returned []
// Phase 1: matrix 3904 rows 3904 cols
[2022-05-20 22:14:08] [INFO ] Computed 401 place invariants in 10 ms
[2022-05-20 22:14:09] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
// Phase 1: matrix 3904 rows 3904 cols
[2022-05-20 22:14:09] [INFO ] Computed 401 place invariants in 8 ms
[2022-05-20 22:14:11] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3904/3913 places, 3904/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3904/3913 places, 3904/3913 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-09 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=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1197 1), p2:(EQ s3866 0), p1:(EQ s300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-09 finished in 4669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((!F(p0)||X(X(p1))) U X(!p1)))'
Support contains 2 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 554 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:12] [INFO ] Computed 401 place invariants in 16 ms
[2022-05-20 22:14:13] [INFO ] Implicit Places using invariants in 813 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:13] [INFO ] Computed 401 place invariants in 9 ms
[2022-05-20 22:14:14] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:14] [INFO ] Computed 401 place invariants in 11 ms
[2022-05-20 22:14:16] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false, false, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}]], initial=2, aps=[p0:(EQ s3684 1), p1:(EQ s2491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-10 finished in 5015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(X(!G(p1))) U p2)))'
Support contains 6 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1101 transitions
Trivial Post-agglo rules discarded 1101 transitions
Performed 1101 trivial Post agglomeration. Transition count delta: 1101
Iterating post reduction 0 with 1101 rules applied. Total rules applied 1101 place count 3912 transition count 2811
Reduce places removed 1101 places and 0 transitions.
Iterating post reduction 1 with 1101 rules applied. Total rules applied 2202 place count 2811 transition count 2811
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 790 Pre rules applied. Total rules applied 2202 place count 2811 transition count 2021
Deduced a syphon composed of 790 places in 5 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 2 with 1580 rules applied. Total rules applied 3782 place count 2021 transition count 2021
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3791 place count 2012 transition count 2012
Iterating global reduction 2 with 9 rules applied. Total rules applied 3800 place count 2012 transition count 2012
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3800 place count 2012 transition count 2005
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 3814 place count 2005 transition count 2005
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 0 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 5604 place count 1110 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5605 place count 1110 transition count 1109
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 5607 place count 1109 transition count 1108
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 5809 place count 1008 transition count 1208
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 6011 place count 907 transition count 1308
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6203 place count 811 transition count 1404
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6205 place count 809 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6206 place count 808 transition count 1402
Applied a total of 6206 rules in 549 ms. Remains 808 /3913 variables (removed 3105) and now considering 1402/3913 (removed 2511) transitions.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:14:17] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 22:14:17] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:14:17] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:14:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 22:14:18] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2022-05-20 22:14:18] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:14:18] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:14:19] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 808/3913 places, 1402/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/3913 places, 1402/3913 transitions.
Stuttering acceptance computed with spot in 185 ms :[p1, (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(NEQ s35 1), p2:(AND (EQ s701 1) (EQ s704 1) (EQ s710 1)), p0:(AND (EQ s453 1) (EQ s678 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-11 finished in 2844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1100 transitions
Trivial Post-agglo rules discarded 1100 transitions
Performed 1100 trivial Post agglomeration. Transition count delta: 1100
Iterating post reduction 0 with 1100 rules applied. Total rules applied 1100 place count 3912 transition count 2812
Reduce places removed 1100 places and 0 transitions.
Iterating post reduction 1 with 1100 rules applied. Total rules applied 2200 place count 2812 transition count 2812
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2200 place count 2812 transition count 2020
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3784 place count 2020 transition count 2020
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3793 place count 2011 transition count 2011
Iterating global reduction 2 with 9 rules applied. Total rules applied 3802 place count 2011 transition count 2011
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3802 place count 2011 transition count 2003
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 3818 place count 2003 transition count 2003
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 0 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 5608 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 1108 transition count 1107
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 5611 place count 1107 transition count 1106
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 5813 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
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 6015 place count 905 transition count 1307
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6207 place count 809 transition count 1402
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6208 place count 809 transition count 1402
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6210 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6211 place count 806 transition count 1400
Applied a total of 6211 rules in 590 ms. Remains 806 /3913 variables (removed 3107) and now considering 1400/3913 (removed 2513) transitions.
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:14:20] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:14:20] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:14:20] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 22:14:21] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
[2022-05-20 22:14:21] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1400 rows 806 cols
[2022-05-20 22:14:21] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:14:22] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3913 places, 1400/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 806/3913 places, 1400/3913 transitions.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NEQ s714 1) (NEQ s47 1)), p0:(EQ s653 1), p1:(NEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-12 finished in 2658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!(p0 U p1)))||X((F(p2) U p2))))))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 552 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:22] [INFO ] Computed 401 place invariants in 16 ms
[2022-05-20 22:14:23] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:23] [INFO ] Computed 401 place invariants in 9 ms
[2022-05-20 22:14:24] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:24] [INFO ] Computed 401 place invariants in 14 ms
[2022-05-20 22:14:26] [INFO ] Dead Transitions using invariants and state equation in 1972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s3181 1), p1:(EQ s3145 1), p0:(NEQ s1442 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 299 reset in 373 ms.
Product exploration explored 100000 steps with 302 reset in 438 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/3902 stabilizing places and 1199/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 359 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 268 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:29] [INFO ] Computed 401 place invariants in 13 ms
[2022-05-20 22:14:29] [INFO ] Implicit Places using invariants in 801 ms returned []
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:29] [INFO ] Computed 401 place invariants in 9 ms
[2022-05-20 22:14:31] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
// Phase 1: matrix 3902 rows 3902 cols
[2022-05-20 22:14:31] [INFO ] Computed 401 place invariants in 17 ms
[2022-05-20 22:14:33] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/3902 stabilizing places and 1199/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 399 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 299 reset in 414 ms.
Product exploration explored 100000 steps with 300 reset in 395 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1097 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3902 transition count 3902
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 1097 place count 3902 transition count 4302
Deduced a syphon composed of 1499 places in 12 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 1499 place count 3902 transition count 4302
Performed 1196 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2695 places in 8 ms
Iterating global reduction 1 with 1196 rules applied. Total rules applied 2695 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2696 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 797 places :
Symmetric choice reduction at 2 with 797 rule applications. Total rules 3493 place count 3105 transition count 3504
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 797 rules applied. Total rules applied 4290 place count 3105 transition count 3504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1899 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4291 place count 3105 transition count 3504
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4293 place count 3103 transition count 3502
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4295 place count 3103 transition count 3502
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1998 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4396 place count 3103 transition count 4234
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4497 place count 3002 transition count 4032
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4598 place count 3002 transition count 4032
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 1998 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4699 place count 3002 transition count 4757
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4800 place count 2901 transition count 4555
Deduced a syphon composed of 1897 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4901 place count 2901 transition count 4555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -734
Deduced a syphon composed of 1998 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5002 place count 2901 transition count 5289
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5103 place count 2800 transition count 5087
Deduced a syphon composed of 1897 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5204 place count 2800 transition count 5087
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1992 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5299 place count 2800 transition count 5770
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5394 place count 2705 transition count 5580
Deduced a syphon composed of 1897 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5489 place count 2705 transition count 5580
Deduced a syphon composed of 1897 places in 2 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5492 place count 2705 transition count 5577
Deduced a syphon composed of 1897 places in 1 ms
Applied a total of 5492 rules in 4263 ms. Remains 2705 /3902 variables (removed 1197) and now considering 5577/3902 (removed -1675) transitions.
[2022-05-20 22:14:40] [INFO ] Redundant transitions in 236 ms returned []
// Phase 1: matrix 5577 rows 2705 cols
[2022-05-20 22:14:40] [INFO ] Computed 401 place invariants in 94 ms
[2022-05-20 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 2766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2705/3902 places, 5577/3902 transitions.
Finished structural reductions, in 1 iterations. Remains : 2705/3902 places, 5577/3902 transitions.
Stuttering criterion allowed to conclude after 38 steps with 3 reset in 6 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-13 finished in 20590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(X(G(X(F(p0)))))))))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1103 transitions
Trivial Post-agglo rules discarded 1103 transitions
Performed 1103 trivial Post agglomeration. Transition count delta: 1103
Iterating post reduction 0 with 1103 rules applied. Total rules applied 1103 place count 3912 transition count 2809
Reduce places removed 1103 places and 0 transitions.
Iterating post reduction 1 with 1103 rules applied. Total rules applied 2206 place count 2809 transition count 2809
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2206 place count 2809 transition count 2017
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3790 place count 2017 transition count 2017
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 3800 place count 2007 transition count 2007
Iterating global reduction 2 with 10 rules applied. Total rules applied 3810 place count 2007 transition count 2007
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3810 place count 2007 transition count 1999
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 3826 place count 1999 transition count 1999
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 0 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 5616 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 1104 transition count 1103
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 5619 place count 1103 transition count 1102
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 5821 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
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 6023 place count 901 transition count 1303
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6215 place count 805 transition count 1398
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6217 place count 803 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6218 place count 802 transition count 1396
Applied a total of 6218 rules in 539 ms. Remains 802 /3913 variables (removed 3111) and now considering 1396/3913 (removed 2517) transitions.
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:43] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:43] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:43] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:14:44] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
[2022-05-20 22:14:44] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:44] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3913 places, 1396/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/3913 places, 1396/3913 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s561 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26 reset in 824 ms.
Product exploration explored 100000 steps with 32 reset in 1017 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 18672 steps, run visited all 1 properties in 318 ms. (steps per millisecond=58 )
Probabilistic random walk after 18672 steps, saw 11312 distinct states, run finished after 318 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1396/1396 transitions.
Applied a total of 0 rules in 27 ms. Remains 802 /802 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:48] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:48] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:14:49] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2022-05-20 22:14:49] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:49] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:14:50] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1396/1396 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18672 steps, run visited all 1 properties in 314 ms. (steps per millisecond=59 )
Probabilistic random walk after 18672 steps, saw 11312 distinct states, run finished after 314 ms. (steps per millisecond=59 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 619 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32 reset in 809 ms.
Product exploration explored 100000 steps with 34 reset in 1030 ms.
Built C files in :
/tmp/ltsmin14398046993711950652
[2022-05-20 22:14:53] [INFO ] Computing symmetric may disable matrix : 1396 transitions.
[2022-05-20 22:14:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:53] [INFO ] Computing symmetric may enable matrix : 1396 transitions.
[2022-05-20 22:14:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:53] [INFO ] Computing Do-Not-Accords matrix : 1396 transitions.
[2022-05-20 22:14:53] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:53] [INFO ] Built C files in 290ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14398046993711950652
Running compilation step : cd /tmp/ltsmin14398046993711950652;'/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/ltsmin14398046993711950652;'/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/ltsmin14398046993711950652;'/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 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1396/1396 transitions.
Applied a total of 0 rules in 31 ms. Remains 802 /802 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:56] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:14:57] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:57] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:58] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2022-05-20 22:14:58] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1396 rows 802 cols
[2022-05-20 22:14:58] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:14:58] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1396/1396 transitions.
Built C files in :
/tmp/ltsmin4004325528794366276
[2022-05-20 22:14:58] [INFO ] Computing symmetric may disable matrix : 1396 transitions.
[2022-05-20 22:14:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:58] [INFO ] Computing symmetric may enable matrix : 1396 transitions.
[2022-05-20 22:14:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:58] [INFO ] Computing Do-Not-Accords matrix : 1396 transitions.
[2022-05-20 22:14:58] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:14:58] [INFO ] Built C files in 244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4004325528794366276
Running compilation step : cd /tmp/ltsmin4004325528794366276;'/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/ltsmin4004325528794366276;'/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/ltsmin4004325528794366276;'/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 22:15:02] [INFO ] Flatten gal took : 62 ms
[2022-05-20 22:15:02] [INFO ] Flatten gal took : 62 ms
[2022-05-20 22:15:02] [INFO ] Time to serialize gal into /tmp/LTL2752428076641119696.gal : 8 ms
[2022-05-20 22:15:02] [INFO ] Time to serialize properties into /tmp/LTL2113862411285562517.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/LTL2752428076641119696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2113862411285562517.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/LTL2752428...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(X(G(X(F("(p3515==0)"))))))))))
Formula 0 simplified : !GFGFXGXF"(p3515==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.28324e+77 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
369 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.87586,109064,1,0,9,570662,24,6,30130,118120,24
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100B-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-100B-LTLFireability-14 finished in 23473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(((p0 U X(X(G(p1))))&&p1)))))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1103 transitions
Trivial Post-agglo rules discarded 1103 transitions
Performed 1103 trivial Post agglomeration. Transition count delta: 1103
Iterating post reduction 0 with 1103 rules applied. Total rules applied 1103 place count 3912 transition count 2809
Reduce places removed 1103 places and 0 transitions.
Iterating post reduction 1 with 1103 rules applied. Total rules applied 2206 place count 2809 transition count 2809
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2206 place count 2809 transition count 2017
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3790 place count 2017 transition count 2017
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 3800 place count 2007 transition count 2007
Iterating global reduction 2 with 10 rules applied. Total rules applied 3810 place count 2007 transition count 2007
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3810 place count 2007 transition count 1999
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 3826 place count 1999 transition count 1999
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 1 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 5610 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5611 place count 1107 transition count 1106
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 5613 place count 1106 transition count 1105
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 5815 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
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 6017 place count 904 transition count 1306
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6211 place count 807 transition count 1403
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6213 place count 805 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6214 place count 804 transition count 1401
Applied a total of 6214 rules in 562 ms. Remains 804 /3913 variables (removed 3109) and now considering 1401/3913 (removed 2512) transitions.
// Phase 1: matrix 1401 rows 804 cols
[2022-05-20 22:15:06] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:15:07] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 1401 rows 804 cols
[2022-05-20 22:15:07] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:15:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-20 22:15:08] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2022-05-20 22:15:08] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1401 rows 804 cols
[2022-05-20 22:15:08] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:15:08] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3913 places, 1401/3913 transitions.
Finished structural reductions, in 1 iterations. Remains : 804/3913 places, 1401/3913 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-15 finished in 2671 ms.
All properties solved by simple procedures.
Total runtime 186041 ms.

BK_STOP 1653084909047

--------------------
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-100B"
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-100B, 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-165286026201052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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