Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679245753105

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:09:14] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-19 17:09:14] [INFO ] Transformed 1503 places.
[2023-03-19 17:09:14] [INFO ] Transformed 1503 transitions.
[2023-03-19 17:09:14] [INFO ] Found NUPN structural information;
[2023-03-19 17:09:14] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-030B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 317 place count 1186 transition count 1186
Iterating global reduction 0 with 317 rules applied. Total rules applied 634 place count 1186 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 635 place count 1185 transition count 1185
Iterating global reduction 0 with 1 rules applied. Total rules applied 636 place count 1185 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 1184 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 1184 transition count 1184
Applied a total of 638 rules in 339 ms. Remains 1184 /1503 variables (removed 319) and now considering 1184/1503 (removed 319) transitions.
// Phase 1: matrix 1184 rows 1184 cols
[2023-03-19 17:09:15] [INFO ] Computed 121 place invariants in 31 ms
[2023-03-19 17:09:16] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-19 17:09:16] [INFO ] Invariant cache hit.
[2023-03-19 17:09:17] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2023-03-19 17:09:17] [INFO ] Invariant cache hit.
[2023-03-19 17:09:17] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1184/1503 places, 1184/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2824 ms. Remains : 1184/1503 places, 1184/1503 transitions.
Support contains 38 out of 1184 places after structural reductions.
[2023-03-19 17:09:18] [INFO ] Flatten gal took : 85 ms
[2023-03-19 17:09:18] [INFO ] Flatten gal took : 44 ms
[2023-03-19 17:09:18] [INFO ] Input system was already deterministic with 1184 transitions.
Support contains 37 out of 1184 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 35) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 17:09:19] [INFO ] Invariant cache hit.
[2023-03-19 17:09:19] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-19 17:09:19] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 17:09:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-19 17:09:22] [INFO ] After 1852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 17:09:22] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 6 ms to minimize.
[2023-03-19 17:09:22] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2023-03-19 17:09:22] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2023-03-19 17:09:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 808 ms
[2023-03-19 17:09:23] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 2 ms to minimize.
[2023-03-19 17:09:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-19 17:09:24] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 2 ms to minimize.
[2023-03-19 17:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-19 17:09:24] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 0 ms to minimize.
[2023-03-19 17:09:24] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
[2023-03-19 17:09:25] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 0 ms to minimize.
[2023-03-19 17:09:25] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:09:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 916 ms
[2023-03-19 17:09:25] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 0 ms to minimize.
[2023-03-19 17:09:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-19 17:09:26] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2023-03-19 17:09:26] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 0 ms to minimize.
[2023-03-19 17:09:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-19 17:09:26] [INFO ] After 6415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1309 ms.
[2023-03-19 17:09:27] [INFO ] After 8359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 407 ms.
Support contains 18 out of 1184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 1184 transition count 865
Reduce places removed 319 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 321 rules applied. Total rules applied 640 place count 865 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 642 place count 863 transition count 863
Performed 230 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 230 Pre rules applied. Total rules applied 642 place count 863 transition count 633
Deduced a syphon composed of 230 places in 3 ms
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 3 with 460 rules applied. Total rules applied 1102 place count 633 transition count 633
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1103 place count 632 transition count 632
Iterating global reduction 3 with 1 rules applied. Total rules applied 1104 place count 632 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1104 place count 632 transition count 631
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1106 place count 631 transition count 631
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 279
Deduced a syphon composed of 279 places in 1 ms
Reduce places removed 279 places and 0 transitions.
Iterating global reduction 3 with 558 rules applied. Total rules applied 1664 place count 352 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1665 place count 352 transition count 351
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1667 place count 351 transition count 350
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 1835 place count 267 transition count 423
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1836 place count 267 transition count 422
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1838 place count 267 transition count 420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1840 place count 265 transition count 420
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1841 place count 265 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1842 place count 264 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1843 place count 263 transition count 418
Applied a total of 1843 rules in 213 ms. Remains 263 /1184 variables (removed 921) and now considering 418/1184 (removed 766) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 263/1184 places, 418/1184 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :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 39 ms. (steps per millisecond=256 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 418 rows 263 cols
[2023-03-19 17:09:29] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-19 17:09:29] [INFO ] [Real]Absence check using 120 positive place invariants in 11 ms returned sat
[2023-03-19 17:09:29] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 17:09:29] [INFO ] [Nat]Absence check using 120 positive place invariants in 11 ms returned sat
[2023-03-19 17:09:29] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 17:09:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 17:09:29] [INFO ] After 100ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 17:09:29] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-19 17:09:30] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 261 ms.
Support contains 10 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 418/418 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 263 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 262 transition count 417
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 262 transition count 415
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 260 transition count 415
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 8 place count 259 transition count 414
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 253 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 253 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 252 transition count 416
Applied a total of 22 rules in 47 ms. Remains 252 /263 variables (removed 11) and now considering 416/418 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 252/263 places, 416/418 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 140765 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140765 steps, saw 92386 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 416 rows 252 cols
[2023-03-19 17:09:34] [INFO ] Computed 120 place invariants in 5 ms
[2023-03-19 17:09:34] [INFO ] [Real]Absence check using 120 positive place invariants in 16 ms returned sat
[2023-03-19 17:09:34] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 17:09:34] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-19 17:09:34] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 17:09:34] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-19 17:09:34] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 2 properties in 233 ms.
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 416/416 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 252 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 415
Applied a total of 2 rules in 23 ms. Remains 251 /252 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 251/252 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 153434 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153434 steps, saw 100792 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 415 rows 251 cols
[2023-03-19 17:09:38] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:09:38] [INFO ] [Real]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-19 17:09:39] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:09:39] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-19 17:09:39] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:09:39] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-19 17:09:39] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 205 ms.
Support contains 9 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 251/251 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 415/415 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-19 17:09:39] [INFO ] Invariant cache hit.
[2023-03-19 17:09:39] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-19 17:09:39] [INFO ] Invariant cache hit.
[2023-03-19 17:09:40] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-19 17:09:40] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 17:09:40] [INFO ] Invariant cache hit.
[2023-03-19 17:09:40] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 251/251 places, 415/415 transitions.
Graph (trivial) has 108 edges and 251 vertex of which 4 / 251 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 844 edges and 249 vertex of which 247 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 105 edges and 245 vertex of which 4 / 245 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 243 transition count 406
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 104 edges and 241 vertex of which 6 / 241 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 238 transition count 397
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 102 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 231 transition count 386
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 98 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 223 transition count 372
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 94 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 215 transition count 358
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 90 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 207 transition count 344
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 86 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 199 transition count 330
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 82 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 191 transition count 316
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 78 edges and 187 vertex of which 8 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 183 transition count 302
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 74 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 175 transition count 288
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 70 edges and 171 vertex of which 8 / 171 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 167 transition count 274
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 66 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 204 place count 160 transition count 262
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 63 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 220 place count 154 transition count 250
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 61 edges and 151 vertex of which 6 / 151 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 235 place count 148 transition count 239
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 59 edges and 145 vertex of which 8 / 145 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 250 place count 141 transition count 228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 439 edges and 137 vertex of which 131 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 52 edges and 131 vertex of which 8 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 21 rules applied. Total rules applied 271 place count 127 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 123 vertex of which 8 / 123 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 290 place count 119 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 44 edges and 115 vertex of which 8 / 115 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 309 place count 111 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 40 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 328 place count 103 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 36 edges and 99 vertex of which 4 / 99 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 347 place count 97 transition count 152
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 33 edges and 95 vertex of which 2 / 95 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 20 with 8 rules applied. Total rules applied 355 place count 94 transition count 147
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 359 place count 93 transition count 144
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 22 with 3 rules applied. Total rules applied 362 place count 91 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 366 place count 91 transition count 139
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 23 with 7 rules applied. Total rules applied 373 place count 91 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 374 place count 91 transition count 132
Applied a total of 374 rules in 61 ms. Remains 91 /251 variables (removed 160) and now considering 132/415 (removed 283) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 132 rows 91 cols
[2023-03-19 17:09:40] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-19 17:09:40] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2023-03-19 17:09:40] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:09:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2023-03-19 17:09:40] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:09:40] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:09:40] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 359 stabilizing places and 359 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))&&p0))||(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1171 transition count 1171
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1171 transition count 1171
Applied a total of 26 rules in 72 ms. Remains 1171 /1184 variables (removed 13) and now considering 1171/1184 (removed 13) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-19 17:09:41] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 17:09:41] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-19 17:09:41] [INFO ] Invariant cache hit.
[2023-03-19 17:09:42] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2023-03-19 17:09:42] [INFO ] Invariant cache hit.
[2023-03-19 17:09:42] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1184 places, 1171/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1702 ms. Remains : 1171/1184 places, 1171/1184 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), false]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-00 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: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s154 1) (EQ s196 1) (EQ s222 1)), p2:(AND (NEQ s362 1) (EQ s154 1) (EQ s196 1) (EQ s222 1)), p1:(EQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 526 ms.
Product exploration explored 100000 steps with 4 reset in 488 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 262738 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262738 steps, saw 114716 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:09:48] [INFO ] Invariant cache hit.
[2023-03-19 17:09:48] [INFO ] [Real]Absence check using 121 positive place invariants in 61 ms returned sat
[2023-03-19 17:09:48] [INFO ] After 714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:09:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2023-03-19 17:09:49] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:09:49] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2023-03-19 17:09:49] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 0 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 2 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 5 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 4 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3704 ms
[2023-03-19 17:09:53] [INFO ] After 4198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 17:09:53] [INFO ] After 4444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 844
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 844 transition count 844
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 654 place count 844 transition count 606
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1130 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1670 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1671 place count 336 transition count 335
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 1673 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1849 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1850 place count 247 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1851 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 245 transition count 418
Applied a total of 1852 rules in 60 ms. Remains 245 /1171 variables (removed 926) and now considering 418/1171 (removed 753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 245/1171 places, 418/1171 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) 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 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 97017 steps, run visited all 2 properties in 608 ms. (steps per millisecond=159 )
Probabilistic random walk after 97017 steps, saw 59929 distinct states, run finished after 609 ms. (steps per millisecond=159 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Applied a total of 0 rules in 27 ms. Remains 1171 /1171 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
[2023-03-19 17:09:54] [INFO ] Invariant cache hit.
[2023-03-19 17:09:55] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-19 17:09:55] [INFO ] Invariant cache hit.
[2023-03-19 17:09:56] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2023-03-19 17:09:56] [INFO ] Invariant cache hit.
[2023-03-19 17:09:56] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1952 ms. Remains : 1171/1171 places, 1171/1171 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 260177 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260177 steps, saw 114114 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:10:00] [INFO ] Invariant cache hit.
[2023-03-19 17:10:00] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-19 17:10:00] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:10:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 17:10:01] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 1 ms to minimize.
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 2 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 2 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 0 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 0 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 0 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 14 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4084 ms
[2023-03-19 17:10:05] [INFO ] After 4676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-19 17:10:05] [INFO ] After 4997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 844
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 844 transition count 844
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 654 place count 844 transition count 606
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1130 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1670 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1671 place count 336 transition count 335
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 1673 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1849 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1850 place count 247 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1851 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 245 transition count 418
Applied a total of 1852 rules in 76 ms. Remains 245 /1171 variables (removed 926) and now considering 418/1171 (removed 753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 245/1171 places, 418/1171 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 97017 steps, run visited all 2 properties in 889 ms. (steps per millisecond=109 )
Probabilistic random walk after 97017 steps, saw 59929 distinct states, run finished after 889 ms. (steps per millisecond=109 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 412 ms.
Product exploration explored 100000 steps with 2 reset in 558 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 1171
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 327 place count 1171 transition count 1289
Deduced a syphon composed of 446 places in 2 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 446 place count 1171 transition count 1289
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 359 rules applied. Total rules applied 805 place count 1171 transition count 1289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1171 transition count 1288
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 1045 place count 932 transition count 1049
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 1284 place count 932 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1285 place count 932 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1287 place count 930 transition count 1047
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1289 place count 930 transition count 1047
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -712
Deduced a syphon composed of 666 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1390 place count 930 transition count 1759
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1491 place count 829 transition count 1557
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1592 place count 829 transition count 1557
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 582 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1609 place count 829 transition count 1680
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1626 place count 812 transition count 1646
Deduced a syphon composed of 565 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1643 place count 812 transition count 1646
Deduced a syphon composed of 565 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1646 place count 812 transition count 1643
Deduced a syphon composed of 565 places in 1 ms
Applied a total of 1646 rules in 757 ms. Remains 812 /1171 variables (removed 359) and now considering 1643/1171 (removed -472) transitions.
[2023-03-19 17:10:09] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 1643 rows 812 cols
[2023-03-19 17:10:09] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 17:10:10] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/1171 places, 1643/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1709 ms. Remains : 812/1171 places, 1643/1171 transitions.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Applied a total of 0 rules in 73 ms. Remains 1171 /1171 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-19 17:10:10] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:10:10] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-19 17:10:10] [INFO ] Invariant cache hit.
[2023-03-19 17:10:11] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-03-19 17:10:11] [INFO ] Invariant cache hit.
[2023-03-19 17:10:12] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1510 ms. Remains : 1171/1171 places, 1171/1171 transitions.
Treatment of property ShieldRVt-PT-030B-LTLFireability-00 finished in 30969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 654 place count 856 transition count 621
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1124 place count 621 transition count 621
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1133 place count 612 transition count 612
Iterating global reduction 2 with 9 rules applied. Total rules applied 1142 place count 612 transition count 612
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 612 transition count 604
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 604 transition count 604
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1696 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 335 transition count 334
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 1699 place count 334 transition count 333
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1877 place count 245 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 242 transition count 419
Applied a total of 1880 rules in 118 ms. Remains 242 /1184 variables (removed 942) and now considering 419/1184 (removed 765) transitions.
// Phase 1: matrix 419 rows 242 cols
[2023-03-19 17:10:12] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:10:12] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-19 17:10:12] [INFO ] Invariant cache hit.
[2023-03-19 17:10:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:10:12] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-19 17:10:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:10:12] [INFO ] Invariant cache hit.
[2023-03-19 17:10:12] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 419/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 242/1184 places, 419/1184 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-01 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:(NEQ s217 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 10 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-01 finished in 757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(p1)||F(p2)))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1173 transition count 1173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1173 transition count 1173
Applied a total of 22 rules in 69 ms. Remains 1173 /1184 variables (removed 11) and now considering 1173/1184 (removed 11) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:10:12] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 17:10:13] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-19 17:10:13] [INFO ] Invariant cache hit.
[2023-03-19 17:10:13] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-19 17:10:13] [INFO ] Invariant cache hit.
[2023-03-19 17:10:14] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1184 places, 1173/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1545 ms. Remains : 1173/1184 places, 1173/1184 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s1160 0), p2:(EQ s337 0), p1:(EQ s919 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-02 finished in 1776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1183 transition count 855
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 855 transition count 855
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 656 place count 855 transition count 621
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1124 place count 621 transition count 621
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1133 place count 612 transition count 612
Iterating global reduction 2 with 9 rules applied. Total rules applied 1142 place count 612 transition count 612
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 612 transition count 604
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 604 transition count 604
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1698 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1699 place count 334 transition count 333
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 1701 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1879 place count 244 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1880 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1881 place count 242 transition count 419
Applied a total of 1881 rules in 101 ms. Remains 242 /1184 variables (removed 942) and now considering 419/1184 (removed 765) transitions.
// Phase 1: matrix 419 rows 242 cols
[2023-03-19 17:10:14] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-19 17:10:14] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 17:10:14] [INFO ] Invariant cache hit.
[2023-03-19 17:10:15] [INFO ] State equation strengthened by 290 read => feed constraints.
[2023-03-19 17:10:16] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2023-03-19 17:10:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:10:16] [INFO ] Invariant cache hit.
[2023-03-19 17:10:16] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 419/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1630 ms. Remains : 242/1184 places, 419/1184 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-04 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 s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-04 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F(G(p1))))||(p0&&F(p2)))))'
Support contains 2 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 654 place count 856 transition count 622
Deduced a syphon composed of 234 places in 0 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1130 place count 614 transition count 614
Iterating global reduction 2 with 8 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1154 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 0 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1694 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1695 place count 336 transition count 335
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 1697 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1875 place count 246 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1877 place count 244 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1878 place count 243 transition count 420
Applied a total of 1878 rules in 84 ms. Remains 243 /1184 variables (removed 941) and now considering 420/1184 (removed 764) transitions.
// Phase 1: matrix 420 rows 243 cols
[2023-03-19 17:10:16] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:10:16] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 17:10:16] [INFO ] Invariant cache hit.
[2023-03-19 17:10:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:10:17] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-19 17:10:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:10:17] [INFO ] Invariant cache hit.
[2023-03-19 17:10:17] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1184 places, 420/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 865 ms. Remains : 243/1184 places, 420/1184 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s64 1), p1:(EQ s64 0), p2:(EQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-05 finished in 1088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 654 place count 856 transition count 623
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1120 place count 623 transition count 623
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1129 place count 614 transition count 614
Iterating global reduction 2 with 9 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1154 place count 606 transition count 606
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 0 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 1698 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1699 place count 334 transition count 333
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 1701 place count 333 transition count 332
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1877 place count 245 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 243 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 242 transition count 416
Applied a total of 1880 rules in 102 ms. Remains 242 /1184 variables (removed 942) and now considering 416/1184 (removed 768) transitions.
// Phase 1: matrix 416 rows 242 cols
[2023-03-19 17:10:17] [INFO ] Computed 120 place invariants in 0 ms
[2023-03-19 17:10:17] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-19 17:10:17] [INFO ] Invariant cache hit.
[2023-03-19 17:10:18] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-19 17:10:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:10:18] [INFO ] Invariant cache hit.
[2023-03-19 17:10:18] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 416/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 795 ms. Remains : 242/1184 places, 416/1184 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s217 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-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-07 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((X(p0) U G(p1)) U !p0)))))'
Support contains 2 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1171 transition count 1171
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1171 transition count 1171
Applied a total of 26 rules in 74 ms. Remains 1171 /1184 variables (removed 13) and now considering 1171/1184 (removed 13) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-19 17:10:18] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:10:18] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-19 17:10:18] [INFO ] Invariant cache hit.
[2023-03-19 17:10:19] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2023-03-19 17:10:19] [INFO ] Invariant cache hit.
[2023-03-19 17:10:19] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1184 places, 1171/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1591 ms. Remains : 1171/1184 places, 1171/1184 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), p0, (OR (NOT p1) p0), p0, true, p0, p0, true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(EQ s867 1), p0:(NEQ s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 213 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-08 finished in 1792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (!p0&&G(p1)&&X(F(p2))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 54 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-19 17:10:20] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 17:10:20] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-19 17:10:20] [INFO ] Invariant cache hit.
[2023-03-19 17:10:21] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-19 17:10:21] [INFO ] Invariant cache hit.
[2023-03-19 17:10:21] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1464 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (NOT p0), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s824 1), p1:(NEQ s723 1), p2:(EQ s820 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 3 reset in 390 ms.
Stack based approach found an accepted trace after 3997 steps with 0 reset with depth 3998 and stack size 3828 in 25 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-09 finished in 2051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 1183 transition count 858
Reduce places removed 325 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 327 rules applied. Total rules applied 652 place count 858 transition count 856
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 654 place count 856 transition count 623
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1120 place count 623 transition count 623
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1129 place count 614 transition count 614
Iterating global reduction 3 with 9 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
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 1154 place count 606 transition count 606
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1690 place count 338 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1691 place count 338 transition count 337
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1693 place count 337 transition count 336
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1869 place count 249 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1871 place count 247 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1872 place count 246 transition count 420
Applied a total of 1872 rules in 73 ms. Remains 246 /1184 variables (removed 938) and now considering 420/1184 (removed 764) transitions.
// Phase 1: matrix 420 rows 246 cols
[2023-03-19 17:10:22] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:10:22] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-19 17:10:22] [INFO ] Invariant cache hit.
[2023-03-19 17:10:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-19 17:10:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2023-03-19 17:10:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:10:22] [INFO ] Invariant cache hit.
[2023-03-19 17:10:23] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/1184 places, 420/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1029 ms. Remains : 246/1184 places, 420/1184 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s79 1) (EQ s47 1)), p0:(EQ s185 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-10 finished in 1100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(F(p1))||(F(p1)&&G(F(p2))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1173 transition count 1173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1173 transition count 1173
Applied a total of 22 rules in 60 ms. Remains 1173 /1184 variables (removed 11) and now considering 1173/1184 (removed 11) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:10:23] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 17:10:23] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-19 17:10:23] [INFO ] Invariant cache hit.
[2023-03-19 17:10:24] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-19 17:10:24] [INFO ] Invariant cache hit.
[2023-03-19 17:10:24] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1184 places, 1173/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1616 ms. Remains : 1173/1184 places, 1173/1184 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s289 1), p0:(EQ s778 1), p2:(EQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-11 finished in 1775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(G(p1))&&(p2||G(p3)))))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1183 transition count 857
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 857 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 654 place count 856 transition count 622
Deduced a syphon composed of 234 places in 0 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1128 place count 616 transition count 616
Iterating global reduction 3 with 6 rules applied. Total rules applied 1134 place count 616 transition count 616
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1134 place count 616 transition count 611
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1144 place count 611 transition count 611
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 0 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 3 with 548 rules applied. Total rules applied 1692 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1693 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1695 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1871 place count 248 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1873 place count 246 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1874 place count 245 transition count 417
Applied a total of 1874 rules in 69 ms. Remains 245 /1184 variables (removed 939) and now considering 417/1184 (removed 767) transitions.
// Phase 1: matrix 417 rows 245 cols
[2023-03-19 17:10:25] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-19 17:10:25] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-19 17:10:25] [INFO ] Invariant cache hit.
[2023-03-19 17:10:25] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-19 17:10:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:10:25] [INFO ] Invariant cache hit.
[2023-03-19 17:10:25] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1184 places, 417/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 245/1184 places, 417/1184 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s156 1), p3:(NEQ s4 1), p0:(EQ s59 1), p1:(NEQ s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1881 steps with 1 reset in 8 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-12 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F((p1 U (p2||G(p1))))) U !p0))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1183 transition count 857
Reduce places removed 326 places and 0 transitions.
Iterating post reduction 1 with 326 rules applied. Total rules applied 652 place count 857 transition count 857
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 652 place count 857 transition count 622
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1130 place count 614 transition count 614
Iterating global reduction 2 with 8 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1138 place count 614 transition count 607
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1152 place count 607 transition count 607
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 0 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1692 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1693 place count 337 transition count 336
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 1695 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1871 place count 248 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 245 transition count 418
Applied a total of 1874 rules in 76 ms. Remains 245 /1184 variables (removed 939) and now considering 418/1184 (removed 766) transitions.
// Phase 1: matrix 418 rows 245 cols
[2023-03-19 17:10:25] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:10:26] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-19 17:10:26] [INFO ] Invariant cache hit.
[2023-03-19 17:10:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:10:26] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-19 17:10:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:10:26] [INFO ] Invariant cache hit.
[2023-03-19 17:10:26] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1184 places, 418/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 748 ms. Remains : 245/1184 places, 418/1184 transitions.
Stuttering acceptance computed with spot in 69 ms :[p0, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s41 1), p2:(AND (NEQ s174 1) (NEQ s186 1)), p1:(NEQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-13 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U p2))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 58 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-19 17:10:26] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 17:10:26] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-19 17:10:26] [INFO ] Invariant cache hit.
[2023-03-19 17:10:27] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-19 17:10:27] [INFO ] Invariant cache hit.
[2023-03-19 17:10:28] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1429 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s439 1) (EQ s728 1) (EQ s1057 1)), p0:(EQ s1057 1), p1:(NEQ s631 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 42617 steps with 0 reset in 144 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-14 finished in 1650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((p1&&G(p2)))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 52 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-19 17:10:28] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:10:28] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-19 17:10:28] [INFO ] Invariant cache hit.
[2023-03-19 17:10:29] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2023-03-19 17:10:29] [INFO ] Invariant cache hit.
[2023-03-19 17:10:29] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1602 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(EQ s389 0), p2:(EQ s481 1), p1:(EQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-15 finished in 1800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))&&p0))||(!p1 U (p2||G(!p1)))))'
[2023-03-19 17:10:30] [INFO ] Flatten gal took : 41 ms
[2023-03-19 17:10:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 17:10:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1184 places, 1184 transitions and 2908 arcs took 41 ms.
Total runtime 75507 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-030B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/436
LTLFireability

BK_STOP 1679246015821

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 ShieldRVt-PT-030B-LTLFireability-00 153751 m, 30750 m/sec, 660658 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 4/32 ShieldRVt-PT-030B-LTLFireability-00 280686 m, 25387 m/sec, 1338802 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 5/32 ShieldRVt-PT-030B-LTLFireability-00 417521 m, 27367 m/sec, 2052872 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 6/32 ShieldRVt-PT-030B-LTLFireability-00 552227 m, 26941 m/sec, 2812376 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 7/32 ShieldRVt-PT-030B-LTLFireability-00 689323 m, 27419 m/sec, 3532461 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 8/32 ShieldRVt-PT-030B-LTLFireability-00 831076 m, 28350 m/sec, 4306744 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 8/32 ShieldRVt-PT-030B-LTLFireability-00 948359 m, 23456 m/sec, 5055370 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 9/32 ShieldRVt-PT-030B-LTLFireability-00 1066091 m, 23546 m/sec, 5778538 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 10/32 ShieldRVt-PT-030B-LTLFireability-00 1167456 m, 20273 m/sec, 6497804 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 11/32 ShieldRVt-PT-030B-LTLFireability-00 1294170 m, 25342 m/sec, 7271482 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 12/32 ShieldRVt-PT-030B-LTLFireability-00 1431135 m, 27393 m/sec, 7982523 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 13/32 ShieldRVt-PT-030B-LTLFireability-00 1554734 m, 24719 m/sec, 8696750 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 14/32 ShieldRVt-PT-030B-LTLFireability-00 1680117 m, 25076 m/sec, 9475484 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 15/32 ShieldRVt-PT-030B-LTLFireability-00 1790056 m, 21987 m/sec, 10181584 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 15/32 ShieldRVt-PT-030B-LTLFireability-00 1900752 m, 22139 m/sec, 10917676 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 16/32 ShieldRVt-PT-030B-LTLFireability-00 2018006 m, 23450 m/sec, 11627865 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 17/32 ShieldRVt-PT-030B-LTLFireability-00 2144380 m, 25274 m/sec, 12306918 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3600 18/32 ShieldRVt-PT-030B-LTLFireability-00 2264487 m, 24021 m/sec, 13042419 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3600 19/32 ShieldRVt-PT-030B-LTLFireability-00 2378708 m, 22844 m/sec, 13750894 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3600 20/32 ShieldRVt-PT-030B-LTLFireability-00 2482853 m, 20829 m/sec, 14452348 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3600 21/32 ShieldRVt-PT-030B-LTLFireability-00 2593715 m, 22172 m/sec, 15156520 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3600 21/32 ShieldRVt-PT-030B-LTLFireability-00 2710723 m, 23401 m/sec, 15879482 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3600 22/32 ShieldRVt-PT-030B-LTLFireability-00 2828213 m, 23498 m/sec, 16635798 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3600 23/32 ShieldRVt-PT-030B-LTLFireability-00 2930908 m, 20539 m/sec, 17390264 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3600 24/32 ShieldRVt-PT-030B-LTLFireability-00 3031109 m, 20040 m/sec, 18105432 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3600 24/32 ShieldRVt-PT-030B-LTLFireability-00 3127393 m, 19256 m/sec, 18826809 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3600 25/32 ShieldRVt-PT-030B-LTLFireability-00 3225912 m, 19703 m/sec, 19562428 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3600 26/32 ShieldRVt-PT-030B-LTLFireability-00 3335293 m, 21876 m/sec, 20322546 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3600 27/32 ShieldRVt-PT-030B-LTLFireability-00 3455461 m, 24033 m/sec, 21051913 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3600 28/32 ShieldRVt-PT-030B-LTLFireability-00 3561704 m, 21248 m/sec, 21798767 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3600 28/32 ShieldRVt-PT-030B-LTLFireability-00 3667752 m, 21209 m/sec, 22542934 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3600 29/32 ShieldRVt-PT-030B-LTLFireability-00 3772906 m, 21030 m/sec, 23325451 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3600 30/32 ShieldRVt-PT-030B-LTLFireability-00 3861563 m, 17731 m/sec, 24023921 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3600 30/32 ShieldRVt-PT-030B-LTLFireability-00 3963650 m, 20417 m/sec, 24749753 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/3600 31/32 ShieldRVt-PT-030B-LTLFireability-00 4087501 m, 24770 m/sec, 25490026 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/3600 32/32 ShieldRVt-PT-030B-LTLFireability-00 4213481 m, 25196 m/sec, 26214667 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLFireability-00: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLFireability-00: LTL unknown AGGR


Time elapsed: 185 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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