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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 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 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 239K 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-020B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653076600000

Running Version 202205111006
[2022-05-20 19:56:41] [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 19:56:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:56:41] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-20 19:56:41] [INFO ] Transformed 1003 places.
[2022-05-20 19:56:41] [INFO ] Transformed 1003 transitions.
[2022-05-20 19:56:41] [INFO ] Found NUPN structural information;
[2022-05-20 19:56:41] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-020B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 798 transition count 798
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 798 transition count 798
Applied a total of 410 rules in 151 ms. Remains 798 /1003 variables (removed 205) and now considering 798/1003 (removed 205) transitions.
// Phase 1: matrix 798 rows 798 cols
[2022-05-20 19:56:41] [INFO ] Computed 81 place invariants in 28 ms
[2022-05-20 19:56:42] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 798 rows 798 cols
[2022-05-20 19:56:42] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:56:42] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
// Phase 1: matrix 798 rows 798 cols
[2022-05-20 19:56:42] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 19:56:43] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 798/1003 places, 798/1003 transitions.
Finished structural reductions, in 1 iterations. Remains : 798/1003 places, 798/1003 transitions.
Support contains 30 out of 798 places after structural reductions.
[2022-05-20 19:56:43] [INFO ] Flatten gal took : 92 ms
[2022-05-20 19:56:43] [INFO ] Flatten gal took : 42 ms
[2022-05-20 19:56:43] [INFO ] Input system was already deterministic with 798 transitions.
Support contains 27 out of 798 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 798 rows 798 cols
[2022-05-20 19:56:44] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:56:44] [INFO ] [Real]Absence check using 81 positive place invariants in 51 ms returned sat
[2022-05-20 19:56:45] [INFO ] After 678ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2022-05-20 19:56:45] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 10 ms to minimize.
[2022-05-20 19:56:46] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 2 ms to minimize.
[2022-05-20 19:56:46] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 2 ms to minimize.
[2022-05-20 19:56:46] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2022-05-20 19:56:46] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2022-05-20 19:56:47] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2022-05-20 19:56:48] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2022-05-20 19:56:48] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2022-05-20 19:56:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2519 ms
[2022-05-20 19:56:48] [INFO ] After 3240ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 19:56:48] [INFO ] After 3767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 19:56:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-05-20 19:56:49] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-20 19:56:50] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-20 19:56:50] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2022-05-20 19:56:50] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 19:56:50] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2022-05-20 19:56:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 635 ms
[2022-05-20 19:56:50] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-20 19:56:51] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-05-20 19:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2022-05-20 19:56:51] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-20 19:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-20 19:56:51] [INFO ] After 2507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 462 ms.
[2022-05-20 19:56:52] [INFO ] After 3768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 15 out of 798 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 798/798 places, 798/798 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 798 transition count 584
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 216 rules applied. Total rules applied 430 place count 584 transition count 582
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 433 place count 583 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 581 transition count 580
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 435 place count 581 transition count 432
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 731 place count 433 transition count 432
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 736 place count 428 transition count 427
Iterating global reduction 4 with 5 rules applied. Total rules applied 741 place count 428 transition count 427
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 741 place count 428 transition count 423
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 749 place count 424 transition count 423
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 1 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 4 with 374 rules applied. Total rules applied 1123 place count 237 transition count 236
Renaming transitions due to excessive name length > 1024 char.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1229 place count 184 transition count 278
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1230 place count 184 transition count 277
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1232 place count 184 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1234 place count 182 transition count 275
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1235 place count 182 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 181 transition count 273
Applied a total of 1236 rules in 144 ms. Remains 181 /798 variables (removed 617) and now considering 273/798 (removed 525) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/798 places, 273/798 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 273 rows 181 cols
[2022-05-20 19:56:53] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:56:53] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:53] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 19:56:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:53] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 19:56:53] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-05-20 19:56:53] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 8 out of 181 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 181/181 places, 273/273 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 270
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 178 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 178 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 177 transition count 269
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 2 with 2 rules applied. Total rules applied 10 place count 176 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 173 transition count 270
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 173 transition count 269
Applied a total of 17 rules in 25 ms. Remains 173 /181 variables (removed 8) and now considering 269/273 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 173/181 places, 269/273 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 269 rows 173 cols
[2022-05-20 19:56:54] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:56:54] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:54] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:56:54] [INFO ] [Nat]Absence check using 81 positive place invariants in 8 ms returned sat
[2022-05-20 19:56:54] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 19:56:54] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-20 19:56:54] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 173/173 places, 269/269 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 173 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 169 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 167 transition count 268
Applied a total of 11 rules in 16 ms. Remains 167 /173 variables (removed 6) and now considering 268/269 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/173 places, 268/269 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 268 rows 167 cols
[2022-05-20 19:56:54] [INFO ] Computed 80 place invariants in 2 ms
[2022-05-20 19:56:54] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:54] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:56:54] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-05-20 19:56:54] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:56:54] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 19:56:54] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 167/167 places, 268/268 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 167 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 166 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 165 transition count 269
Applied a total of 4 rules in 13 ms. Remains 165 /167 variables (removed 2) and now considering 269/268 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/167 places, 269/268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 918294 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 918294 steps, saw 622014 distinct states, run finished after 3003 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 269 rows 165 cols
[2022-05-20 19:56:57] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:56:57] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:57] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:56:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:56:58] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:56:58] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-20 19:56:58] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 269/269 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 269/269 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 269/269 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 269/269 (removed 0) transitions.
// Phase 1: matrix 269 rows 165 cols
[2022-05-20 19:56:58] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:56:58] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 269 rows 165 cols
[2022-05-20 19:56:58] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:56:58] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-05-20 19:56:58] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 269 rows 165 cols
[2022-05-20 19:56:58] [INFO ] Computed 80 place invariants in 3 ms
[2022-05-20 19:56:58] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 269/269 transitions.
Graph (trivial) has 74 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 548 edges and 163 vertex of which 161 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 71 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 157 transition count 260
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 70 edges and 155 vertex of which 6 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 152 transition count 251
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 68 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 145 transition count 240
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 64 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 137 transition count 226
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 60 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 129 transition count 212
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 56 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 121 transition count 198
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 52 edges and 117 vertex of which 6 / 117 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 114 transition count 184
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 48 edges and 111 vertex of which 4 / 111 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 14 rules applied. Total rules applied 125 place count 109 transition count 174
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 45 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 9 rules applied. Total rules applied 134 place count 106 transition count 168
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 9 with 5 rules applied. Total rules applied 139 place count 105 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 139 place count 105 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 142 place count 103 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 145 place count 101 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 42 edges and 101 vertex of which 2 / 101 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 149 place count 100 transition count 159
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 151 place count 100 transition count 157
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 153 place count 100 transition count 155
Applied a total of 153 rules in 37 ms. Remains 100 /165 variables (removed 65) and now considering 155/269 (removed 114) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 100 cols
[2022-05-20 19:56:58] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 19:56:58] [INFO ] [Real]Absence check using 48 positive place invariants in 8 ms returned sat
[2022-05-20 19:56:58] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:56:58] [INFO ] [Nat]Absence check using 48 positive place invariants in 5 ms returned sat
[2022-05-20 19:56:58] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:56:58] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-20 19:56:58] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 19:56:58] [INFO ] Flatten gal took : 11 ms
[2022-05-20 19:56:58] [INFO ] Flatten gal took : 9 ms
[2022-05-20 19:56:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12527596470278209898.gal : 13 ms
[2022-05-20 19:56:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11882291386028520368.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17353886879509124391;'/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/ReachabilityCardinality12527596470278209898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11882291386028520368.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...321
Loading property file /tmp/ReachabilityCardinality11882291386028520368.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 361
Reachability property AtomicPropp2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,7680,0.044229,5100,2,290,11,2367,6,0,558,1324,0
Total reachable state count : 7680

Verifying 1 reachability properties.
Reachability property AtomicPropp2 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
AtomicPropp2,508,0.045403,5100,2,124,11,2367,7,0,567,1324,0
Computed a total of 243 stabilizing places and 243 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 444 place count 576 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 445 place count 575 transition count 574
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 445 place count 575 transition count 421
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 751 place count 422 transition count 421
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 763 place count 410 transition count 409
Iterating global reduction 3 with 12 rules applied. Total rules applied 775 place count 410 transition count 409
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 775 place count 410 transition count 401
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 791 place count 402 transition count 401
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1149 place count 223 transition count 222
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 76 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:56:59] [INFO ] Computed 80 place invariants in 3 ms
[2022-05-20 19:56:59] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:56:59] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:56:59] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-20 19:56:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:56:59] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:56:59] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s131 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 43 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-01 finished in 769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))||p1) U p2))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 75 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:56:59] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 19:57:00] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:57:00] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:57:00] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:57:00] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 19:57:00] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s467 1) (EQ s60 1)), p1:(AND (EQ s60 1) (OR (EQ s117 1) (EQ s467 1))), p0:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-02 finished in 1244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(!G((!X(p0)||p1)))) U p2))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 47 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:01] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 19:57:01] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:01] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:57:01] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:01] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 19:57:02] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 163 ms :[p2, true, (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s546 1) (EQ s114 1)), p1:(NEQ s114 1), p0:(EQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 407 ms.
Product exploration explored 100000 steps with 1 reset in 349 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 203776 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203776 steps, saw 86939 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:06] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:57:07] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2022-05-20 19:57:07] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 19:57:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 21 ms returned sat
[2022-05-20 19:57:08] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2022-05-20 19:57:08] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2022-05-20 19:57:09] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2022-05-20 19:57:09] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 5 ms to minimize.
[2022-05-20 19:57:09] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2022-05-20 19:57:09] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2022-05-20 19:57:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1469 ms
[2022-05-20 19:57:09] [INFO ] After 2028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 121 ms.
[2022-05-20 19:57:09] [INFO ] After 2344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 783 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 783/783 places, 783/783 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 783 transition count 566
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 566 transition count 566
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 434 place count 566 transition count 407
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 752 place count 407 transition count 407
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 1116 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 225 transition count 224
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 1119 place count 224 transition count 223
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1235 place count 166 transition count 278
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 166 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 165 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1238 place count 164 transition count 276
Applied a total of 1238 rules in 43 ms. Remains 164 /783 variables (removed 619) and now considering 276/783 (removed 507) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/783 places, 276/783 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:57:10] [INFO ] Computed 80 place invariants in 2 ms
[2022-05-20 19:57:10] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:57:10] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:57:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:57:10] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:57:10] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 19:57:10] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 276/276 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 164 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 163 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 162 transition count 277
Applied a total of 4 rules in 9 ms. Remains 162 /164 variables (removed 2) and now considering 277/276 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/164 places, 277/276 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 835514 steps, run visited all 1 properties in 2627 ms. (steps per millisecond=318 )
Probabilistic random walk after 835514 steps, saw 580251 distinct states, run finished after 2627 ms. (steps per millisecond=318 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 783/783 transitions.
Applied a total of 0 rules in 19 ms. Remains 783 /783 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:13] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:57:14] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:14] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:57:14] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:14] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:57:14] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 783/783 places, 783/783 transitions.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 196172 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196172 steps, saw 84371 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:18] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:57:18] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2022-05-20 19:57:19] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 19:57:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2022-05-20 19:57:19] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 19:57:19] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2022-05-20 19:57:20] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-05-20 19:57:21] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 19:57:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1390 ms
[2022-05-20 19:57:21] [INFO ] After 1960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-05-20 19:57:21] [INFO ] After 2279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 783 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 783/783 places, 783/783 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 783 transition count 566
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 566 transition count 566
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 434 place count 566 transition count 407
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 752 place count 407 transition count 407
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 0 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 1116 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 225 transition count 224
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 1119 place count 224 transition count 223
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1235 place count 166 transition count 278
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 166 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 165 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1238 place count 164 transition count 276
Applied a total of 1238 rules in 34 ms. Remains 164 /783 variables (removed 619) and now considering 276/783 (removed 507) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/783 places, 276/783 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 184271 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184271 steps, saw 127138 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:57:24] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:57:24] [INFO ] [Real]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-05-20 19:57:25] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 19:57:25] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-05-20 19:57:25] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 19:57:25] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-20 19:57:25] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 276/276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 276/276 (removed 0) transitions.
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:57:25] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:57:25] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:57:25] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:57:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-05-20 19:57:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:57:25] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:57:25] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 276/276 transitions.
Graph (trivial) has 78 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 546 edges and 162 vertex of which 160 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 75 edges and 158 vertex of which 4 / 158 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 156 transition count 267
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 74 edges and 154 vertex of which 6 / 154 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 151 transition count 258
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 72 edges and 148 vertex of which 8 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 144 transition count 247
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 68 edges and 140 vertex of which 8 / 140 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 136 transition count 233
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 64 edges and 132 vertex of which 6 / 132 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 129 transition count 219
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 60 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 87 place count 124 transition count 209
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 57 edges and 122 vertex of which 2 / 122 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 9 rules applied. Total rules applied 96 place count 121 transition count 203
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 101 place count 120 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 101 place count 120 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 104 place count 118 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 107 place count 116 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 111 place count 116 transition count 193
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 112 place count 116 transition count 192
Applied a total of 112 rules in 41 ms. Remains 116 /164 variables (removed 48) and now considering 192/276 (removed 84) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 192 rows 116 cols
[2022-05-20 19:57:25] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-20 19:57:25] [INFO ] [Real]Absence check using 56 positive place invariants in 7 ms returned sat
[2022-05-20 19:57:25] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 19:57:25] [INFO ] [Nat]Absence check using 56 positive place invariants in 5 ms returned sat
[2022-05-20 19:57:25] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 19:57:26] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-20 19:57:26] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-20 19:57:26] [INFO ] Flatten gal took : 13 ms
[2022-05-20 19:57:26] [INFO ] Flatten gal took : 11 ms
[2022-05-20 19:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality552156123146795420.gal : 4 ms
[2022-05-20 19:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4444941588071809419.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14342237919740566813;'/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/ReachabilityCardinality552156123146795420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4444941588071809419.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...318
Loading property file /tmp/ReachabilityCardinality4444941588071809419.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :24 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 82
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :82 after 800
Reachability property apf1 is true.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :800 after 18972
Reachability property apf3 is true.
Reachability property apf2 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18972 after 294906
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :294906 after 1.57288e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.57288e+06 after 9.66368e+09
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,3.24259e+17,4.83182,5568,2,177,17,8564,7,0,662,8517,0
Total reachable state count : 324259173170675712

Verifying 4 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1024,4.83267,5832,2,127,17,8564,7,0,665,8517,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1024,4.83298,5832,2,127,17,8564,8,0,665,8517,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,12288,4.83319,5832,2,131,17,8564,9,0,667,8517,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1024,4.83345,5832,2,127,17,8564,10,0,668,8517,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 141 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 149 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 0 reset in 304 ms.
Product exploration explored 100000 steps with 1 reset in 339 ms.
Built C files in :
/tmp/ltsmin5811371711586368352
[2022-05-20 19:57:32] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5811371711586368352
Running compilation step : cd /tmp/ltsmin5811371711586368352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin5811371711586368352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5811371711586368352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11901460965774817049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 783/783 transitions.
Applied a total of 0 rules in 29 ms. Remains 783 /783 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:47] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 19:57:47] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:47] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 19:57:48] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:57:48] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 19:57:48] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 783/783 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin15934191244873634087
[2022-05-20 19:57:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15934191244873634087
Running compilation step : cd /tmp/ltsmin15934191244873634087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1144 ms.
Running link step : cd /tmp/ltsmin15934191244873634087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15934191244873634087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18082180867824398537.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:58:03] [INFO ] Flatten gal took : 30 ms
[2022-05-20 19:58:03] [INFO ] Flatten gal took : 30 ms
[2022-05-20 19:58:03] [INFO ] Time to serialize gal into /tmp/LTL4601442155513087561.gal : 6 ms
[2022-05-20 19:58:03] [INFO ] Time to serialize properties into /tmp/LTL15975646705134546342.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/LTL4601442155513087561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15975646705134546342.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/LTL4601442...267
Read 1 LTL properties
Checking formula 0 : !((!((X(G(!(G((!(X("(p179==1)")))||("(p139!=1)"))))))U("((p694==1)&&(p139==1))"))))
Formula 0 simplified : XG!G("(p139!=1)" | !X"(p179==1)") U "((p694==1)&&(p139==1))"
Detected timeout of ITS tools.
[2022-05-20 19:58:18] [INFO ] Flatten gal took : 30 ms
[2022-05-20 19:58:18] [INFO ] Applying decomposition
[2022-05-20 19:58:18] [INFO ] Flatten gal took : 25 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/graph17943482466968746590.txt' '-o' '/tmp/graph17943482466968746590.bin' '-w' '/tmp/graph17943482466968746590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17943482466968746590.bin' '-l' '-1' '-v' '-w' '/tmp/graph17943482466968746590.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:58:18] [INFO ] Decomposing Gal with order
[2022-05-20 19:58:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:58:19] [INFO ] Removed a total of 199 redundant transitions.
[2022-05-20 19:58:19] [INFO ] Flatten gal took : 207 ms
[2022-05-20 19:58:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-20 19:58:19] [INFO ] Time to serialize gal into /tmp/LTL7585176016288204621.gal : 12 ms
[2022-05-20 19:58:19] [INFO ] Time to serialize properties into /tmp/LTL7967856967447957386.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7585176016288204621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7967856967447957386.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7585176...245
Read 1 LTL properties
Checking formula 0 : !((!((X(G(!(G((!(X("(i7.i1.u58.p179==1)")))||("(i4.i2.u47.p139!=1)"))))))U("((i14.i3.u215.p694==1)&&(i4.i2.u47.p139==1))"))))
Formula 0 simplified : XG!G("(i4.i2.u47.p139!=1)" | !X"(i7.i1.u58.p179==1)") U "((i14.i3.u215.p694==1)&&(i4.i2.u47.p139==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3657192604025170506
[2022-05-20 19:58:34] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3657192604025170506
Running compilation step : cd /tmp/ltsmin3657192604025170506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1127 ms.
Running link step : cd /tmp/ltsmin3657192604025170506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3657192604025170506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(X([]()||(LTLAPp1==true))))) U (LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-020B-LTLFireability-03 finished in 108401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))&&G(X(p1))))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 44 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:49] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:58:49] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:49] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:50] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:50] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:58:50] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s547 1), p0:(EQ s502 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-05 finished in 1259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))&&(G(F(X(p2)))||F(p2))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 797 transition count 579
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 438 place count 579 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 439 place count 578 transition count 577
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 439 place count 578 transition count 422
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 749 place count 423 transition count 422
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 759 place count 413 transition count 412
Iterating global reduction 3 with 10 rules applied. Total rules applied 769 place count 413 transition count 412
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 769 place count 413 transition count 406
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 781 place count 407 transition count 406
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1141 place count 227 transition count 226
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1257 place count 169 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1259 place count 167 transition count 280
Applied a total of 1259 rules in 52 ms. Remains 167 /798 variables (removed 631) and now considering 280/798 (removed 518) transitions.
// Phase 1: matrix 280 rows 167 cols
[2022-05-20 19:58:50] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:50] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 280 rows 167 cols
[2022-05-20 19:58:50] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:58:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 19:58:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2022-05-20 19:58:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 280 rows 167 cols
[2022-05-20 19:58:51] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:58:51] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/798 places, 280/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/798 places, 280/798 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s147 1), p0:(OR (EQ s75 1) (EQ s160 1)), p2:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], 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-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-06 finished in 701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U p1)&&X(p2)))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Applied a total of 28 rules in 24 ms. Remains 784 /798 variables (removed 14) and now considering 784/798 (removed 14) transitions.
// Phase 1: matrix 784 rows 784 cols
[2022-05-20 19:58:51] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 19:58:51] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 784 rows 784 cols
[2022-05-20 19:58:51] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:52] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 784 rows 784 cols
[2022-05-20 19:58:52] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:52] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 784/798 places, 784/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 784/798 places, 784/798 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) p1), true, (NOT p2), (AND p0 p1), p0]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s758 1), p0:(NEQ s288 1), p2:(EQ s564 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4312 steps with 3 reset in 19 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-07 finished in 1283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 797 transition count 577
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 442 place count 577 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 443 place count 576 transition count 575
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 443 place count 576 transition count 420
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 753 place count 421 transition count 420
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 764 place count 410 transition count 409
Iterating global reduction 3 with 11 rules applied. Total rules applied 775 place count 410 transition count 409
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 775 place count 410 transition count 401
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 791 place count 402 transition count 401
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1147 place count 224 transition count 223
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1265 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 279
Applied a total of 1268 rules in 49 ms. Remains 162 /798 variables (removed 636) and now considering 279/798 (removed 519) transitions.
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:58:52] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:58:52] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:58:52] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:58:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 19:58:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-05-20 19:58:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:58:53] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:58:53] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 279/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/798 places, 279/798 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s77 0)], 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 16 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-08 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&p1))||G(p2)))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 797 transition count 577
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 442 place count 577 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 443 place count 576 transition count 575
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 443 place count 576 transition count 423
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 747 place count 424 transition count 423
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 758 place count 413 transition count 412
Iterating global reduction 3 with 11 rules applied. Total rules applied 769 place count 413 transition count 412
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 769 place count 413 transition count 404
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 785 place count 405 transition count 404
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1145 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1259 place count 168 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1261 place count 166 transition count 276
Applied a total of 1261 rules in 44 ms. Remains 166 /798 variables (removed 632) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 166 cols
[2022-05-20 19:58:53] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:58:53] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 276 rows 166 cols
[2022-05-20 19:58:53] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:58:53] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2022-05-20 19:58:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 276 rows 166 cols
[2022-05-20 19:58:53] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 19:58:53] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/798 places, 276/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (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=2, aps=[p2:(OR (EQ s159 0) (EQ s19 0)), p0:(EQ s65 1), p1:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 47 reset in 357 ms.
Entered a terminal (fully accepting) state of product in 60319 steps with 39 reset in 236 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-09 finished in 1214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !X(!p0))))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 48 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:54] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:58:54] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:54] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 19:58:55] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:55] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:55] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-10 finished in 1198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((X(p0)||p1)))||p2))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 41 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:55] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 19:58:55] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:55] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:56] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
// Phase 1: matrix 782 rows 782 cols
[2022-05-20 19:58:56] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:56] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s501 0), p1:(EQ s630 1), p0:(EQ s261 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 1736 steps with 0 reset in 8 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-11 finished in 1265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(!(G(p0) U p1))&&F(!(p2 U !F(p3)))))))'
Support contains 4 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 40 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:56] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:58:57] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:57] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:57] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:57] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 19:58:57] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), p1, (NOT p3), (NOT p3), (AND p1 p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s266 1), p3:(EQ s252 1), p2:(EQ s486 1), p0:(EQ s645 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 560 reset in 221 ms.
Product exploration explored 100000 steps with 558 reset in 314 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Detected a total of 238/783 stabilizing places and 238/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 510 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p3), (NOT p3)]
Finished random walk after 150 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 12 factoid took 383 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p3)]
// Phase 1: matrix 783 rows 783 cols
[2022-05-20 19:58:59] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 19:59:00] [INFO ] [Real]Absence check using 81 positive place invariants in 40 ms returned sat
[2022-05-20 19:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:59:01] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2022-05-20 19:59:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:59:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2022-05-20 19:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:59:02] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2022-05-20 19:59:02] [INFO ] Computed and/alt/rep : 782/1144/782 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-20 19:59:12] [INFO ] Added : 771 causal constraints over 155 iterations in 10190 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 1 out of 783 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 : 783/783 places, 783/783 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 782 transition count 565
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 565 transition count 565
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 434 place count 565 transition count 407
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 750 place count 407 transition count 407
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1106 place count 229 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1107 place count 229 transition count 228
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 1109 place count 228 transition count 227
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1225 place count 170 transition count 283
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1227 place count 168 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1228 place count 167 transition count 281
Applied a total of 1228 rules in 38 ms. Remains 167 /783 variables (removed 616) and now considering 281/783 (removed 502) transitions.
// Phase 1: matrix 281 rows 167 cols
[2022-05-20 19:59:12] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:12] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 281 rows 167 cols
[2022-05-20 19:59:12] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 19:59:12] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-05-20 19:59:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 281 rows 167 cols
[2022-05-20 19:59:12] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:13] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/783 places, 281/783 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/783 places, 281/783 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/167 stabilizing places and 4/281 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p3), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p3)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p3), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p3))), (X (X p3)), (F p3)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p3)]
// Phase 1: matrix 281 rows 167 cols
[2022-05-20 19:59:13] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:13] [INFO ] [Real]Absence check using 80 positive place invariants in 14 ms returned sat
[2022-05-20 19:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:59:13] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-20 19:59:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:59:13] [INFO ] [Nat]Absence check using 80 positive place invariants in 14 ms returned sat
[2022-05-20 19:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:59:13] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-20 19:59:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 19:59:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2022-05-20 19:59:13] [INFO ] Computed and/alt/rep : 263/835/263 causal constraints (skipped 12 transitions) in 17 ms.
[2022-05-20 19:59:14] [INFO ] Added : 205 causal constraints over 42 iterations in 909 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 38 ms :[(NOT p3)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-13 finished in 17921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 797 transition count 575
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 224 rules applied. Total rules applied 446 place count 575 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 447 place count 574 transition count 573
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 447 place count 574 transition count 419
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 755 place count 420 transition count 419
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 767 place count 408 transition count 407
Iterating global reduction 3 with 12 rules applied. Total rules applied 779 place count 408 transition count 407
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 779 place count 408 transition count 399
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 795 place count 400 transition count 399
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 1147 place count 224 transition count 223
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1265 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 279
Applied a total of 1268 rules in 42 ms. Remains 162 /798 variables (removed 636) and now considering 279/798 (removed 519) transitions.
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:59:14] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:14] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:59:14] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 19:59:15] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2022-05-20 19:59:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 279 rows 162 cols
[2022-05-20 19:59:15] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:15] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 279/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/798 places, 279/798 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-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 s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-14 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 797 transition count 577
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 442 place count 577 transition count 575
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 444 place count 576 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 445 place count 575 transition count 574
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 154 Pre rules applied. Total rules applied 445 place count 575 transition count 420
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 4 with 308 rules applied. Total rules applied 753 place count 421 transition count 420
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 765 place count 409 transition count 408
Iterating global reduction 4 with 12 rules applied. Total rules applied 777 place count 409 transition count 408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 777 place count 409 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 793 place count 401 transition count 400
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 4 with 356 rules applied. Total rules applied 1149 place count 223 transition count 222
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 44 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:59:15] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:15] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:59:15] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:15] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-05-20 19:59:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 276 rows 162 cols
[2022-05-20 19:59:15] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-15 finished in 461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(!G((!X(p0)||p1)))) U p2))'
Found a SL insensitive property : ShieldRVt-PT-020B-LTLFireability-03
Stuttering acceptance computed with spot in 175 ms :[p2, true, (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 444 place count 576 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 445 place count 575 transition count 574
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 445 place count 575 transition count 421
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 751 place count 422 transition count 421
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 761 place count 412 transition count 411
Iterating global reduction 3 with 10 rules applied. Total rules applied 771 place count 412 transition count 411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 771 place count 412 transition count 404
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 785 place count 405 transition count 404
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1145 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1261 place count 167 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1263 place count 165 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1264 place count 164 transition count 277
Applied a total of 1264 rules in 48 ms. Remains 164 /798 variables (removed 634) and now considering 277/798 (removed 521) transitions.
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:16] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:16] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:16] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:16] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:16] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 164/798 places, 277/798 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/798 places, 277/798 transitions.
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s115 1) (EQ s20 1)), p1:(NEQ s20 1), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 414 ms.
Product exploration explored 100000 steps with 13 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 423 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:18] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:18] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:59:18] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 19:59:18] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:59:18] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 19:59:18] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 19:59:18] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 277/277 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 276
Applied a total of 1 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 276/277 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 276/277 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 276 rows 164 cols
[2022-05-20 19:59:18] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:18] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-05-20 19:59:19] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:59:19] [INFO ] [Nat]Absence check using 80 positive place invariants in 10 ms returned sat
[2022-05-20 19:59:19] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 19:59:19] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 19:59:19] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 276/276 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 254446 steps, run visited all 2 properties in 917 ms. (steps per millisecond=277 )
Probabilistic random walk after 254446 steps, saw 125443 distinct states, run finished after 917 ms. (steps per millisecond=277 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 149 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 277/277 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 277/277 (removed 0) transitions.
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:21] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-20 19:59:21] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:21] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:21] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 277 rows 164 cols
[2022-05-20 19:59:21] [INFO ] Computed 80 place invariants in 0 ms
[2022-05-20 19:59:21] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 277/277 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 6443 steps, including 1 resets, run visited all 4 properties in 301 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), true, (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p2), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 120 ms :[(AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 27 reset in 332 ms.
Product exploration explored 100000 steps with 33 reset in 370 ms.
Built C files in :
/tmp/ltsmin16433239174434783727
[2022-05-20 19:59:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16433239174434783727
Running compilation step : cd /tmp/ltsmin16433239174434783727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin16433239174434783727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16433239174434783727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5479034908158691179.hoa' '--buchi-type=spotba'
LTSmin run took 2340 ms.
Treatment of property ShieldRVt-PT-020B-LTLFireability-03 finished in 10848 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-03 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 19:59:26] [INFO ] Flatten gal took : 26 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 165470 ms.

BK_STOP 1653076766795

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-020B"
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-020B, 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-165286026100988"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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