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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 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.3K 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.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 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 239K 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-020B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679245531284

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-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:05:33] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-19 17:05:33] [INFO ] Transformed 1003 places.
[2023-03-19 17:05:33] [INFO ] Transformed 1003 transitions.
[2023-03-19 17:05:33] [INFO ] Found NUPN structural information;
[2023-03-19 17:05:33] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 800 transition count 800
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 800 transition count 800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 407 place count 799 transition count 799
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 799 transition count 799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 409 place count 798 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 410 place count 798 transition count 798
Applied a total of 410 rules in 230 ms. Remains 798 /1003 variables (removed 205) and now considering 798/1003 (removed 205) transitions.
// Phase 1: matrix 798 rows 798 cols
[2023-03-19 17:05:34] [INFO ] Computed 81 place invariants in 21 ms
[2023-03-19 17:05:34] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-19 17:05:34] [INFO ] Invariant cache hit.
[2023-03-19 17:05:35] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2023-03-19 17:05:35] [INFO ] Invariant cache hit.
[2023-03-19 17:05:35] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 798/1003 places, 798/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1792 ms. Remains : 798/1003 places, 798/1003 transitions.
Support contains 35 out of 798 places after structural reductions.
[2023-03-19 17:05:36] [INFO ] Flatten gal took : 79 ms
[2023-03-19 17:05:36] [INFO ] Flatten gal took : 32 ms
[2023-03-19 17:05:36] [INFO ] Input system was already deterministic with 798 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 17:05:37] [INFO ] Invariant cache hit.
[2023-03-19 17:05:37] [INFO ] [Real]Absence check using 81 positive place invariants in 77 ms returned sat
[2023-03-19 17:05:38] [INFO ] After 1771ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-19 17:05:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2023-03-19 17:05:40] [INFO ] After 827ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-19 17:05:40] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 8 ms to minimize.
[2023-03-19 17:05:40] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2023-03-19 17:05:41] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2023-03-19 17:05:41] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2023-03-19 17:05:41] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:05:45] [INFO ] Deduced a trap composed of 42 places in 4549 ms of which 0 ms to minimize.
[2023-03-19 17:05:46] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:05:46] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 1 ms to minimize.
[2023-03-19 17:05:46] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-19 17:05:47] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
[2023-03-19 17:05:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6846 ms
[2023-03-19 17:05:47] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-19 17:05:47] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-19 17:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-19 17:05:48] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2023-03-19 17:05:48] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2023-03-19 17:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-19 17:05:48] [INFO ] After 9447ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-03-19 17:05:49] [INFO ] After 10554ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 16 out of 798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 798/798 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 798 transition count 585
Reduce places removed 213 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 215 rules applied. Total rules applied 428 place count 585 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 430 place count 583 transition count 583
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 430 place count 583 transition count 438
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 720 place count 438 transition count 438
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 726 place count 432 transition count 432
Iterating global reduction 3 with 6 rules applied. Total rules applied 732 place count 432 transition count 432
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 732 place count 432 transition count 428
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 740 place count 428 transition count 428
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 1 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 1118 place count 239 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1119 place count 239 transition count 238
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 1121 place count 238 transition count 237
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1227 place count 185 transition count 282
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1228 place count 185 transition count 281
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1230 place count 185 transition count 279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1232 place count 183 transition count 279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1233 place count 183 transition count 278
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1234 place count 183 transition count 278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1235 place count 183 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 182 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1237 place count 181 transition count 276
Applied a total of 1237 rules in 183 ms. Remains 181 /798 variables (removed 617) and now considering 276/798 (removed 522) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 181/798 places, 276/798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 276 rows 181 cols
[2023-03-19 17:05:50] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:05:50] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-19 17:05:50] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:05:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 7 ms returned sat
[2023-03-19 17:05:50] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:05:50] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-19 17:05:50] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 276/276 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 179 transition count 274
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 179 transition count 269
Deduced a syphon composed of 5 places in 13 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 174 transition count 269
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 170 transition count 265
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 165 transition count 272
Applied a total of 32 rules in 72 ms. Remains 165 /181 variables (removed 16) and now considering 272/276 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 165/181 places, 272/276 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 165 cols
[2023-03-19 17:05:51] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:05:51] [INFO ] [Real]Absence check using 80 positive place invariants in 21 ms returned sat
[2023-03-19 17:05:51] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:05:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 7 ms returned sat
[2023-03-19 17:05:51] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:05:51] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 17:05:51] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 272/272 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 165 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 271
Applied a total of 2 rules in 6 ms. Remains 164 /165 variables (removed 1) and now considering 271/272 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 164/165 places, 271/272 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 271 rows 164 cols
[2023-03-19 17:05:51] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:05:52] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2023-03-19 17:05:52] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:05:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2023-03-19 17:05:52] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:05:52] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 17:05:52] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 271/271 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 271
Applied a total of 2 rules in 11 ms. Remains 163 /164 variables (removed 1) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 163/164 places, 271/271 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 271 rows 163 cols
[2023-03-19 17:05:52] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-19 17:05:52] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2023-03-19 17:05:52] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:05:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2023-03-19 17:05:52] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:05:52] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:05:52] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 115 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 241 stabilizing places and 241 stable transitions
FORMULA ShieldRVt-PT-020B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(p1))||G(p2)))))'
Support contains 4 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Applied a total of 28 rules in 43 ms. Remains 784 /798 variables (removed 14) and now considering 784/798 (removed 14) transitions.
// Phase 1: matrix 784 rows 784 cols
[2023-03-19 17:05:53] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-19 17:05:53] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-19 17:05:53] [INFO ] Invariant cache hit.
[2023-03-19 17:05:54] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-19 17:05:54] [INFO ] Invariant cache hit.
[2023-03-19 17:05:54] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 784/798 places, 784/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1299 ms. Remains : 784/798 places, 784/798 transitions.
Stuttering acceptance computed with spot in 513 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s543 0) (EQ s127 1)), p2:(EQ s160 1), p1:(AND (EQ s68 1) (EQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-00 finished in 1895 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 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 797 transition count 575
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 444 place count 575 transition count 575
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 444 place count 575 transition count 426
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 742 place count 426 transition count 426
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 755 place count 413 transition count 413
Iterating global reduction 2 with 13 rules applied. Total rules applied 768 place count 413 transition count 413
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 768 place count 413 transition count 403
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 788 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1267 place count 164 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1269 place count 162 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1270 place count 161 transition count 278
Applied a total of 1270 rules in 134 ms. Remains 161 /798 variables (removed 637) and now considering 278/798 (removed 520) transitions.
// Phase 1: matrix 278 rows 161 cols
[2023-03-19 17:05:55] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:05:55] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-19 17:05:55] [INFO ] Invariant cache hit.
[2023-03-19 17:05:55] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-19 17:05:55] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 17:05:55] [INFO ] Invariant cache hit.
[2023-03-19 17:05:56] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/798 places, 278/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 737 ms. Remains : 161/798 places, 278/798 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-01 finished in 803 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(G(p0)))))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 40 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-19 17:05:56] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:05:56] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-19 17:05:56] [INFO ] Invariant cache hit.
[2023-03-19 17:05:56] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-19 17:05:56] [INFO ] Invariant cache hit.
[2023-03-19 17:05:57] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1225 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-02 finished in 1372 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 U (G(p0)||(p0&&(X(!p1) U ((X(!p1)&&G((p2&&X(p2))))||X(G(!p1))))))))'
Support contains 4 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 30 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
[2023-03-19 17:05:57] [INFO ] Invariant cache hit.
[2023-03-19 17:05:57] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-19 17:05:57] [INFO ] Invariant cache hit.
[2023-03-19 17:05:58] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2023-03-19 17:05:58] [INFO ] Invariant cache hit.
[2023-03-19 17:05:59] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1539 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 521 ms :[true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p2), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p2 p0), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(NEQ s330 1), p2:(NEQ s564 1), p1:(OR (EQ s723 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1044 steps with 0 reset in 11 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-03 finished in 2100 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((X(((p1||F(p2)||X(X(F(p3)))) U p2))||p0)))'
Support contains 2 out of 798 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 782 transition count 782
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 32 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2023-03-19 17:05:59] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-19 17:05:59] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-19 17:05:59] [INFO ] Invariant cache hit.
[2023-03-19 17:06:00] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-19 17:06:00] [INFO ] Invariant cache hit.
[2023-03-19 17:06:00] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1378 ms. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s436 1) (EQ s217 1)), p2:(EQ s436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 391 reset in 494 ms.
Product exploration explored 100000 steps with 388 reset in 605 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 263 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-19 17:06:02] [INFO ] Invariant cache hit.
[2023-03-19 17:06:03] [INFO ] [Real]Absence check using 81 positive place invariants in 70 ms returned sat
[2023-03-19 17:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:06:04] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2023-03-19 17:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:06:04] [INFO ] [Nat]Absence check using 81 positive place invariants in 66 ms returned sat
[2023-03-19 17:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:06:06] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2023-03-19 17:06:06] [INFO ] Computed and/alt/rep : 781/1143/781 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-19 17:06:18] [INFO ] Added : 781 causal constraints over 157 iterations in 12726 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 782 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 782/782 places, 782/782 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 781 transition count 565
Reduce places removed 216 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 434 place count 565 transition count 563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 436 place count 563 transition count 405
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 752 place count 405 transition count 405
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1106 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1107 place count 228 transition count 227
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 1109 place count 227 transition count 226
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1225 place count 169 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1227 place count 167 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1228 place count 166 transition count 280
Applied a total of 1228 rules in 124 ms. Remains 166 /782 variables (removed 616) and now considering 280/782 (removed 502) transitions.
// Phase 1: matrix 280 rows 166 cols
[2023-03-19 17:06:19] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:06:19] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 17:06:19] [INFO ] Invariant cache hit.
[2023-03-19 17:06:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:06:19] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-19 17:06:19] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:06:19] [INFO ] Invariant cache hit.
[2023-03-19 17:06:19] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/782 places, 280/782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 933 ms. Remains : 166/782 places, 280/782 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-19 17:06:20] [INFO ] Invariant cache hit.
[2023-03-19 17:06:20] [INFO ] [Real]Absence check using 80 positive place invariants in 15 ms returned sat
[2023-03-19 17:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:06:20] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-19 17:06:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:06:20] [INFO ] [Nat]Absence check using 80 positive place invariants in 22 ms returned sat
[2023-03-19 17:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:06:20] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-19 17:06:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:06:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-03-19 17:06:20] [INFO ] Computed and/alt/rep : 275/867/275 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-19 17:06:21] [INFO ] Added : 220 causal constraints over 45 iterations in 746 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-04 finished in 22209 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 X((p1||X(X(!p0)))))))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 32 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-19 17:06:21] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-19 17:06:22] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-19 17:06:22] [INFO ] Invariant cache hit.
[2023-03-19 17:06:22] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-19 17:06:22] [INFO ] Invariant cache hit.
[2023-03-19 17:06:23] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1314 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s420 1), p1:(EQ s267 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]]
Product exploration explored 100000 steps with 20047 reset in 326 ms.
Product exploration explored 100000 steps with 20106 reset in 369 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:06:24] [INFO ] Invariant cache hit.
[2023-03-19 17:06:24] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2023-03-19 17:06:25] [INFO ] After 282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 4 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2949 ms
[2023-03-19 17:06:28] [INFO ] After 3274ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:28] [INFO ] After 3422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:28] [INFO ] [Nat]Absence check using 81 positive place invariants in 27 ms returned sat
[2023-03-19 17:06:28] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 5 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3042 ms
[2023-03-19 17:06:31] [INFO ] After 3366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-19 17:06:31] [INFO ] After 3579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 781/781 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 563
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 436 place count 563 transition count 403
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 756 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1114 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1115 place count 224 transition count 223
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1117 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1235 place count 164 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 164 transition count 279
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1239 place count 162 transition count 278
Applied a total of 1239 rules in 46 ms. Remains 162 /781 variables (removed 619) and now considering 278/781 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 162/781 places, 278/781 transitions.
Finished random walk after 3603 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=327 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 5 factoid took 502 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Applied a total of 0 rules in 13 ms. Remains 781 /781 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-19 17:06:32] [INFO ] Invariant cache hit.
[2023-03-19 17:06:33] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-19 17:06:33] [INFO ] Invariant cache hit.
[2023-03-19 17:06:33] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2023-03-19 17:06:33] [INFO ] Invariant cache hit.
[2023-03-19 17:06:34] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1460 ms. Remains : 781/781 places, 781/781 transitions.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:06:34] [INFO ] Invariant cache hit.
[2023-03-19 17:06:34] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-19 17:06:35] [INFO ] After 252ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 0 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 10 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 0 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2573 ms
[2023-03-19 17:06:37] [INFO ] After 2851ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:37] [INFO ] After 2975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 41 ms returned sat
[2023-03-19 17:06:38] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 4 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 10 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 9 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 0 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3687 ms
[2023-03-19 17:06:42] [INFO ] After 4192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 17:06:42] [INFO ] After 4526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 781/781 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 563
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 436 place count 563 transition count 403
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 756 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1114 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1115 place count 224 transition count 223
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 1117 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1235 place count 164 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 164 transition count 279
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1239 place count 162 transition count 278
Applied a total of 1239 rules in 51 ms. Remains 162 /781 variables (removed 619) and now considering 278/781 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 162/781 places, 278/781 transitions.
Finished random walk after 4598 steps, including 1 resets, run visited all 1 properties in 20 ms. (steps per millisecond=229 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20079 reset in 282 ms.
Product exploration explored 100000 steps with 20010 reset in 294 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 781
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 218 place count 781 transition count 860
Deduced a syphon composed of 297 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 297 place count 781 transition count 860
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 537 places in 0 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 537 place count 781 transition count 860
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 538 place count 781 transition count 859
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 698 place count 621 transition count 699
Deduced a syphon composed of 377 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 858 place count 621 transition count 699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 621 transition count 699
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 861 place count 619 transition count 697
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 619 transition count 697
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -563
Deduced a syphon composed of 453 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 940 place count 619 transition count 1260
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1017 place count 542 transition count 1106
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1094 place count 542 transition count 1106
Deduced a syphon composed of 376 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 1097 place count 542 transition count 1103
Deduced a syphon composed of 376 places in 0 ms
Applied a total of 1097 rules in 265 ms. Remains 542 /781 variables (removed 239) and now considering 1103/781 (removed -322) transitions.
[2023-03-19 17:06:44] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1103 rows 542 cols
[2023-03-19 17:06:44] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-19 17:06:50] [INFO ] Dead Transitions using invariants and state equation in 6010 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 542/781 places, 1103/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6351 ms. Remains : 542/781 places, 1103/781 transitions.
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Applied a total of 0 rules in 54 ms. Remains 781 /781 variables (removed 0) and now considering 781/781 (removed 0) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-19 17:06:50] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-19 17:06:54] [INFO ] Implicit Places using invariants in 3663 ms returned []
[2023-03-19 17:06:54] [INFO ] Invariant cache hit.
[2023-03-19 17:06:55] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 4242 ms to find 0 implicit places.
[2023-03-19 17:06:55] [INFO ] Invariant cache hit.
[2023-03-19 17:06:55] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4770 ms. Remains : 781/781 places, 781/781 transitions.
Treatment of property ShieldRVt-PT-020B-LTLFireability-05 finished in 33838 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)&&X(X(X(G(p1))))))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 782 transition count 782
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 68 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2023-03-19 17:06:55] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:06:57] [INFO ] Implicit Places using invariants in 1762 ms returned []
[2023-03-19 17:06:57] [INFO ] Invariant cache hit.
[2023-03-19 17:06:57] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2023-03-19 17:06:57] [INFO ] Invariant cache hit.
[2023-03-19 17:06:58] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2780 ms. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s258 1), p1:(EQ s477 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]]
Stuttering criterion allowed to conclude after 5673 steps with 0 reset in 17 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-06 finished in 3074 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 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 576 transition count 576
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 442 place count 576 transition count 428
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 738 place count 428 transition count 428
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 752 place count 414 transition count 414
Iterating global reduction 2 with 14 rules applied. Total rules applied 766 place count 414 transition count 414
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 766 place count 414 transition count 403
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 788 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 59 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2023-03-19 17:06:58] [INFO ] Computed 80 place invariants in 0 ms
[2023-03-19 17:06:58] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-19 17:06:58] [INFO ] Invariant cache hit.
[2023-03-19 17:06:59] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-19 17:06:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:06:59] [INFO ] Invariant cache hit.
[2023-03-19 17:06:59] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 923 ms. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-07 finished in 1037 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((F(p0)&&F(p1)&&F(p2))))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 35 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2023-03-19 17:06:59] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:07:00] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-19 17:07:00] [INFO ] Invariant cache hit.
[2023-03-19 17:07:00] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-19 17:07:00] [INFO ] Invariant cache hit.
[2023-03-19 17:07:00] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s284 1), p1:(EQ s99 1), p2:(EQ s177 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4984 steps with 0 reset in 28 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-08 finished in 1607 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)&&F(p1)))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 797 transition count 575
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 444 place count 575 transition count 575
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 444 place count 575 transition count 426
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 742 place count 426 transition count 426
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 754 place count 414 transition count 414
Iterating global reduction 2 with 12 rules applied. Total rules applied 766 place count 414 transition count 414
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 766 place count 414 transition count 405
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 784 place count 405 transition count 405
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1144 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1145 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1147 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1265 place count 165 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 278
Applied a total of 1268 rules in 60 ms. Remains 162 /798 variables (removed 636) and now considering 278/798 (removed 520) transitions.
// Phase 1: matrix 278 rows 162 cols
[2023-03-19 17:07:01] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:07:10] [INFO ] Implicit Places using invariants in 8911 ms returned []
[2023-03-19 17:07:10] [INFO ] Invariant cache hit.
[2023-03-19 17:07:10] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 9188 ms to find 0 implicit places.
[2023-03-19 17:07:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:07:10] [INFO ] Invariant cache hit.
[2023-03-19 17:07:10] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 278/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9380 ms. Remains : 162/798 places, 278/798 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s6 1), p0:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-09 finished in 9546 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(G(p0))&&F((G(p1)||(p2&&F(G(p0))))))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 797 transition count 577
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 577 transition count 577
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 440 place count 577 transition count 428
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 738 place count 428 transition count 428
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 750 place count 416 transition count 416
Iterating global reduction 2 with 12 rules applied. Total rules applied 762 place count 416 transition count 416
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 762 place count 416 transition count 407
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 780 place count 407 transition count 407
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1138 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1139 place count 228 transition count 227
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 1141 place count 227 transition count 226
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1259 place count 168 transition count 283
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1260 place count 168 transition count 283
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1262 place count 166 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1263 place count 165 transition count 281
Applied a total of 1263 rules in 72 ms. Remains 165 /798 variables (removed 633) and now considering 281/798 (removed 517) transitions.
// Phase 1: matrix 281 rows 165 cols
[2023-03-19 17:07:10] [INFO ] Computed 80 place invariants in 0 ms
[2023-03-19 17:07:11] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-19 17:07:11] [INFO ] Invariant cache hit.
[2023-03-19 17:07:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:07:11] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-19 17:07:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:07:11] [INFO ] Invariant cache hit.
[2023-03-19 17:07:11] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/798 places, 281/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 165/798 places, 281/798 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s100 1), p0:(EQ s67 1), p1:(EQ s121 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-10 finished in 931 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)&&F(G(p1)))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 797 transition count 578
Reduce places removed 219 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 439 place count 578 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 577 transition count 577
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 440 place count 577 transition count 429
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 736 place count 429 transition count 429
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 749 place count 416 transition count 416
Iterating global reduction 3 with 13 rules applied. Total rules applied 762 place count 416 transition count 416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 762 place count 416 transition count 405
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 784 place count 405 transition count 405
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1142 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1143 place count 226 transition count 225
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 1145 place count 225 transition count 224
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1259 place count 168 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1261 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1262 place count 165 transition count 276
Applied a total of 1262 rules in 71 ms. Remains 165 /798 variables (removed 633) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 165 cols
[2023-03-19 17:07:11] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-19 17:07:12] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-19 17:07:12] [INFO ] Invariant cache hit.
[2023-03-19 17:07:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-19 17:07:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:07:12] [INFO ] Invariant cache hit.
[2023-03-19 17:07:12] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 583 ms. Remains : 165/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s78 0) (EQ s37 1)), p1:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-11 finished in 737 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 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 576 transition count 576
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 442 place count 576 transition count 427
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 740 place count 427 transition count 427
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 754 place count 413 transition count 413
Iterating global reduction 2 with 14 rules applied. Total rules applied 768 place count 413 transition count 413
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 768 place count 413 transition count 402
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 790 place count 402 transition count 402
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 53 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2023-03-19 17:07:12] [INFO ] Computed 80 place invariants in 0 ms
[2023-03-19 17:07:12] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 17:07:12] [INFO ] Invariant cache hit.
[2023-03-19 17:07:12] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-19 17:07:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:07:12] [INFO ] Invariant cache hit.
[2023-03-19 17:07:13] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 608 ms. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s17 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 25204 steps with 4 reset in 123 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-12 finished in 795 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((p0||X(X(G(p1)))||F(p2))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 24 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2023-03-19 17:07:13] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-19 17:07:13] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-19 17:07:13] [INFO ] Invariant cache hit.
[2023-03-19 17:07:14] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-19 17:07:14] [INFO ] Invariant cache hit.
[2023-03-19 17:07:14] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1241 ms. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s741 1), p0:(EQ s502 1), p1:(EQ s381 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 268 reset in 336 ms.
Stack based approach found an accepted trace after 463 steps with 0 reset with depth 464 and stack size 464 in 2 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-14 finished in 1794 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 X((p1||X(X(!p0)))))))'
[2023-03-19 17:07:15] [INFO ] Flatten gal took : 49 ms
[2023-03-19 17:07:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 17:07:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 798 places, 798 transitions and 1956 arcs took 7 ms.
Total runtime 101815 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLFireability

BK_STOP 1679245920923

--------------------
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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 ShieldRVt-PT-020B-LTLFireability-05
lola: time limit : 1800 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1800 2/32 ShieldRVt-PT-020B-LTLFireability-05 230820 m, 46164 m/sec, 663795 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1800 3/32 ShieldRVt-PT-020B-LTLFireability-05 439597 m, 41755 m/sec, 1371001 t fired, .

Time elapsed: 10 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1800 5/32 ShieldRVt-PT-020B-LTLFireability-05 642372 m, 40555 m/sec, 2074348 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1800 6/32 ShieldRVt-PT-020B-LTLFireability-05 842367 m, 39999 m/sec, 2776778 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1800 7/32 ShieldRVt-PT-020B-LTLFireability-05 1025316 m, 36589 m/sec, 3430808 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/1800 8/32 ShieldRVt-PT-020B-LTLFireability-05 1208671 m, 36671 m/sec, 4099323 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/1800 10/32 ShieldRVt-PT-020B-LTLFireability-05 1385352 m, 35336 m/sec, 4812791 t fired, .

Time elapsed: 35 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/1800 11/32 ShieldRVt-PT-020B-LTLFireability-05 1551724 m, 33274 m/sec, 5468262 t fired, .

Time elapsed: 40 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/1800 12/32 ShieldRVt-PT-020B-LTLFireability-05 1710849 m, 31825 m/sec, 6129560 t fired, .

Time elapsed: 45 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/1800 13/32 ShieldRVt-PT-020B-LTLFireability-05 1879329 m, 33696 m/sec, 6823114 t fired, .

Time elapsed: 50 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/1800 14/32 ShieldRVt-PT-020B-LTLFireability-05 2045146 m, 33163 m/sec, 7524709 t fired, .

Time elapsed: 55 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 60/1800 15/32 ShieldRVt-PT-020B-LTLFireability-05 2213780 m, 33726 m/sec, 8243727 t fired, .

Time elapsed: 60 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 65/1800 16/32 ShieldRVt-PT-020B-LTLFireability-05 2404770 m, 38198 m/sec, 8956711 t fired, .

Time elapsed: 65 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 70/1800 17/32 ShieldRVt-PT-020B-LTLFireability-05 2568804 m, 32806 m/sec, 9628509 t fired, .

Time elapsed: 70 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 75/1800 18/32 ShieldRVt-PT-020B-LTLFireability-05 2736138 m, 33466 m/sec, 10310330 t fired, .

Time elapsed: 75 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 80/1800 19/32 ShieldRVt-PT-020B-LTLFireability-05 2910934 m, 34959 m/sec, 11008001 t fired, .

Time elapsed: 80 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 85/1800 21/32 ShieldRVt-PT-020B-LTLFireability-05 3078560 m, 33525 m/sec, 11647317 t fired, .

Time elapsed: 85 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 90/1800 22/32 ShieldRVt-PT-020B-LTLFireability-05 3266671 m, 37622 m/sec, 12330837 t fired, .

Time elapsed: 90 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 95/1800 23/32 ShieldRVt-PT-020B-LTLFireability-05 3441145 m, 34894 m/sec, 12988170 t fired, .

Time elapsed: 95 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 100/1800 24/32 ShieldRVt-PT-020B-LTLFireability-05 3615649 m, 34900 m/sec, 13659199 t fired, .

Time elapsed: 100 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 105/1800 25/32 ShieldRVt-PT-020B-LTLFireability-05 3799850 m, 36840 m/sec, 14351207 t fired, .

Time elapsed: 105 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 110/1800 26/32 ShieldRVt-PT-020B-LTLFireability-05 3965763 m, 33182 m/sec, 15011993 t fired, .

Time elapsed: 110 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 115/1800 27/32 ShieldRVt-PT-020B-LTLFireability-05 4136608 m, 34169 m/sec, 15688837 t fired, .

Time elapsed: 115 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 120/1800 28/32 ShieldRVt-PT-020B-LTLFireability-05 4307468 m, 34172 m/sec, 16350427 t fired, .

Time elapsed: 120 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 125/1800 30/32 ShieldRVt-PT-020B-LTLFireability-05 4483401 m, 35186 m/sec, 17029513 t fired, .

Time elapsed: 125 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 130/1800 31/32 ShieldRVt-PT-020B-LTLFireability-05 4655210 m, 34361 m/sec, 17693157 t fired, .

Time elapsed: 130 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-020B-LTLFireability-05: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 135/1800 32/32 ShieldRVt-PT-020B-LTLFireability-05 4825961 m, 34150 m/sec, 18361160 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-020B-LTLFireability-05: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: LAUNCH task # 3 (type EXCL) for 0 ShieldRVt-PT-020B-LTLFireability-05
lola: time limit : 3460 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/3460 2/32 ShieldRVt-PT-020B-LTLFireability-05 202309 m, 40461 m/sec, 624198 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/3460 3/32 ShieldRVt-PT-020B-LTLFireability-05 402919 m, 40122 m/sec, 1302000 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/3460 4/32 ShieldRVt-PT-020B-LTLFireability-05 600069 m, 39430 m/sec, 1999612 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/3460 6/32 ShieldRVt-PT-020B-LTLFireability-05 781592 m, 36304 m/sec, 2706902 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/3460 7/32 ShieldRVt-PT-020B-LTLFireability-05 950525 m, 33786 m/sec, 3390639 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/3460 8/32 ShieldRVt-PT-020B-LTLFireability-05 1109099 m, 31714 m/sec, 4058459 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/3460 9/32 ShieldRVt-PT-020B-LTLFireability-05 1291146 m, 36409 m/sec, 4774660 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/3460 10/32 ShieldRVt-PT-020B-LTLFireability-05 1469304 m, 35631 m/sec, 5497030 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 45/3460 11/32 ShieldRVt-PT-020B-LTLFireability-05 1658757 m, 37890 m/sec, 6220144 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 50/3460 13/32 ShieldRVt-PT-020B-LTLFireability-05 1839128 m, 36074 m/sec, 6878535 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 55/3460 14/32 ShieldRVt-PT-020B-LTLFireability-05 2019184 m, 36011 m/sec, 7561549 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 60/3460 15/32 ShieldRVt-PT-020B-LTLFireability-05 2195068 m, 35176 m/sec, 8254380 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 65/3460 16/32 ShieldRVt-PT-020B-LTLFireability-05 2375699 m, 36126 m/sec, 8947596 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 70/3460 17/32 ShieldRVt-PT-020B-LTLFireability-05 2550310 m, 34922 m/sec, 9619830 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 75/3460 18/32 ShieldRVt-PT-020B-LTLFireability-05 2734063 m, 36750 m/sec, 10335944 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 80/3460 20/32 ShieldRVt-PT-020B-LTLFireability-05 2911377 m, 35462 m/sec, 11012717 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 85/3460 21/32 ShieldRVt-PT-020B-LTLFireability-05 3107992 m, 39323 m/sec, 11763750 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 90/3460 22/32 ShieldRVt-PT-020B-LTLFireability-05 3288247 m, 36051 m/sec, 12491395 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 95/3460 23/32 ShieldRVt-PT-020B-LTLFireability-05 3459589 m, 34268 m/sec, 13210725 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 100/3460 24/32 ShieldRVt-PT-020B-LTLFireability-05 3622603 m, 32602 m/sec, 13919596 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 105/3460 25/32 ShieldRVt-PT-020B-LTLFireability-05 3782066 m, 31892 m/sec, 14675121 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 110/3460 26/32 ShieldRVt-PT-020B-LTLFireability-05 3928356 m, 29258 m/sec, 15380252 t fired, .

Time elapsed: 250 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 115/3460 27/32 ShieldRVt-PT-020B-LTLFireability-05 4073909 m, 29110 m/sec, 16098243 t fired, .

Time elapsed: 255 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 120/3460 28/32 ShieldRVt-PT-020B-LTLFireability-05 4237833 m, 32784 m/sec, 16856732 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 125/3460 29/32 ShieldRVt-PT-020B-LTLFireability-05 4387648 m, 29963 m/sec, 17562245 t fired, .

Time elapsed: 265 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 130/3460 30/32 ShieldRVt-PT-020B-LTLFireability-05 4545496 m, 31569 m/sec, 18288523 t fired, .

Time elapsed: 270 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 135/3460 31/32 ShieldRVt-PT-020B-LTLFireability-05 4704497 m, 31800 m/sec, 18979880 t fired, .

Time elapsed: 275 secs. Pages in use: 32
# 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-020B-LTLFireability-05: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 140/3460 32/32 ShieldRVt-PT-020B-LTLFireability-05 4857603 m, 30621 m/sec, 19655223 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-020B-LTLFireability-05: CONJ 0 0 0 0 2 0 2 0

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

Time elapsed: 285 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-020B-LTLFireability-05: CONJ unknown CONJ


Time elapsed: 285 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-020B"
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-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976500284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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