Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789700618.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r373-tall-171683789700618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 239K May 18 16:43 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 1717014842024

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:34:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:34:03] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-29 20:34:03] [INFO ] Transformed 1003 places.
[2024-05-29 20:34:03] [INFO ] Transformed 1003 transitions.
[2024-05-29 20:34:03] [INFO ] Found NUPN structural information;
[2024-05-29 20:34:04] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 796 transition count 796
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 796 transition count 796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 415 place count 795 transition count 795
Iterating global reduction 0 with 1 rules applied. Total rules applied 416 place count 795 transition count 795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 794 transition count 794
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 794 transition count 794
Applied a total of 418 rules in 235 ms. Remains 794 /1003 variables (removed 209) and now considering 794/1003 (removed 209) transitions.
// Phase 1: matrix 794 rows 794 cols
[2024-05-29 20:34:04] [INFO ] Computed 81 invariants in 28 ms
[2024-05-29 20:34:04] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-29 20:34:04] [INFO ] Invariant cache hit.
[2024-05-29 20:34:05] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2024-05-29 20:34:05] [INFO ] Invariant cache hit.
[2024-05-29 20:34:05] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 794/1003 places, 794/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1610 ms. Remains : 794/1003 places, 794/1003 transitions.
Support contains 31 out of 794 places after structural reductions.
[2024-05-29 20:34:06] [INFO ] Flatten gal took : 76 ms
[2024-05-29 20:34:06] [INFO ] Flatten gal took : 35 ms
[2024-05-29 20:34:06] [INFO ] Input system was already deterministic with 794 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 28) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 20:34:06] [INFO ] Invariant cache hit.
[2024-05-29 20:34:07] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:34:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2024-05-29 20:34:07] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 4 ms to minimize.
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:34:08] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:34:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2012 ms
[2024-05-29 20:34:10] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-29 20:34:10] [INFO ] After 2973ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 203 ms.
[2024-05-29 20:34:10] [INFO ] After 3479ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 9 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 794/794 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 794 transition count 577
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 577 transition count 577
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 434 place count 577 transition count 425
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 738 place count 425 transition count 425
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 745 place count 418 transition count 418
Iterating global reduction 2 with 7 rules applied. Total rules applied 752 place count 418 transition count 418
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 752 place count 418 transition count 414
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 760 place count 414 transition count 414
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 1124 place count 232 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1125 place count 232 transition count 231
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 1127 place count 231 transition count 230
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1243 place count 173 transition count 284
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1244 place count 173 transition count 283
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1245 place count 173 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1246 place count 172 transition count 282
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1247 place count 172 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1248 place count 171 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1249 place count 170 transition count 280
Applied a total of 1249 rules in 134 ms. Remains 170 /794 variables (removed 624) and now considering 280/794 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 170/794 places, 280/794 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 280 rows 170 cols
[2024-05-29 20:34:11] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:34:11] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:34:11] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-29 20:34:11] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 20:34:11] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-29 20:34:11] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:34:11] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:34:11] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 20:34:11] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 280/280 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 170 transition count 277
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 167 transition count 277
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 8 place count 166 transition count 277
Applied a total of 8 rules in 14 ms. Remains 166 /170 variables (removed 4) and now considering 277/280 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 166/170 places, 277/280 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 277 rows 166 cols
[2024-05-29 20:34:11] [INFO ] Computed 80 invariants in 2 ms
[2024-05-29 20:34:11] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:34:11] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-29 20:34:11] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 20:34:11] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:34:11] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2024-05-29 20:34:12] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:34:12] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 20:34:12] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 277/277 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 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 164 transition count 275
Applied a total of 4 rules in 13 ms. Remains 164 /166 variables (removed 2) and now considering 275/277 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 164/166 places, 275/277 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 275 rows 164 cols
[2024-05-29 20:34:12] [INFO ] Computed 80 invariants in 2 ms
[2024-05-29 20:34:12] [INFO ] [Real]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:34:12] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 20:34:12] [INFO ] After 77ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 20:34:12] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 163 transition count 273
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 4 place count 162 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 161 transition count 275
Applied a total of 6 rules in 16 ms. Remains 161 /164 variables (removed 3) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 161/164 places, 275/275 transitions.
Finished random walk after 6143 steps, including 3 resets, run visited all 1 properties in 34 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 241 stabilizing places and 241 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)&&X((G(p2)||(p2&&F(!p0))))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 28 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-29 20:34:12] [INFO ] Computed 81 invariants in 4 ms
[2024-05-29 20:34:13] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 20:34:13] [INFO ] Invariant cache hit.
[2024-05-29 20:34:13] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-05-29 20:34:13] [INFO ] Invariant cache hit.
[2024-05-29 20:34:13] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 782/794 places, 782/794 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (AND p0 (NOT p2)), p0]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-00 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=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s401 1), p1:(EQ s530 0), p2:(NEQ s318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18779 steps with 9 reset in 111 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-00 finished in 1663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F((p0||G(p1))))))))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 29 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-29 20:34:14] [INFO ] Computed 81 invariants in 7 ms
[2024-05-29 20:34:14] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-29 20:34:14] [INFO ] Invariant cache hit.
[2024-05-29 20:34:15] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-29 20:34:15] [INFO ] Invariant cache hit.
[2024-05-29 20:34:15] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1120 ms. Remains : 782/794 places, 782/794 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(NEQ s611 1), p0:(EQ s300 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14285 reset in 349 ms.
Product exploration explored 100000 steps with 14285 reset in 367 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 346426 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346426 steps, saw 141677 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:34:20] [INFO ] Invariant cache hit.
[2024-05-29 20:34:20] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:34:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-29 20:34:20] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:20] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:34:20] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:34:21] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 6 ms to minimize.
[2024-05-29 20:34:22] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:34:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3208 ms
[2024-05-29 20:34:23] [INFO ] After 3604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-29 20:34:23] [INFO ] After 3826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 782/782 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 782 transition count 565
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 565 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 564 transition count 564
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 436 place count 564 transition count 405
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 754 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 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1114 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1115 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 4 with 2 rules applied. Total rules applied 1117 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 4 with 118 rules applied. Total rules applied 1235 place count 165 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1236 place count 165 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 164 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Applied a total of 1238 rules in 65 ms. Remains 163 /782 variables (removed 619) and now considering 278/782 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 163/782 places, 278/782 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6608 steps, run visited all 2 properties in 71 ms. (steps per millisecond=93 )
Probabilistic random walk after 6608 steps, saw 4090 distinct states, run finished after 71 ms. (steps per millisecond=93 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 782/782 places, 782/782 transitions.
Applied a total of 0 rules in 12 ms. Remains 782 /782 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-05-29 20:34:25] [INFO ] Invariant cache hit.
[2024-05-29 20:34:25] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-29 20:34:25] [INFO ] Invariant cache hit.
[2024-05-29 20:34:25] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-29 20:34:25] [INFO ] Invariant cache hit.
[2024-05-29 20:34:26] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1106 ms. Remains : 782/782 places, 782/782 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 372976 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372976 steps, saw 151929 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:34:29] [INFO ] Invariant cache hit.
[2024-05-29 20:34:29] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:34:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2024-05-29 20:34:30] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3176 ms
[2024-05-29 20:34:33] [INFO ] After 3570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 20:34:33] [INFO ] After 3776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 782/782 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 782 transition count 565
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 565 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 564 transition count 564
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 436 place count 564 transition count 405
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 754 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 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1114 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1115 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 4 with 2 rules applied. Total rules applied 1117 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 4 with 118 rules applied. Total rules applied 1235 place count 165 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1236 place count 165 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 164 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Applied a total of 1238 rules in 47 ms. Remains 163 /782 variables (removed 619) and now considering 278/782 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 163/782 places, 278/782 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 163 cols
[2024-05-29 20:34:33] [INFO ] Computed 80 invariants in 3 ms
[2024-05-29 20:34:33] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:34:33] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2024-05-29 20:34:33] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:34:33] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 20:34:33] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 278/278 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 163/163 places, 278/278 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6608 steps, run visited all 1 properties in 26 ms. (steps per millisecond=254 )
Probabilistic random walk after 6608 steps, saw 4090 distinct states, run finished after 26 ms. (steps per millisecond=254 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14285 reset in 220 ms.
Product exploration explored 100000 steps with 14285 reset in 218 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 782/782 places, 782/782 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 782 transition count 782
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 218 place count 782 transition count 862
Deduced a syphon composed of 298 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 298 place count 782 transition count 862
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 538 places in 0 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 538 place count 782 transition count 862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 539 place count 782 transition count 861
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 698 place count 623 transition count 702
Deduced a syphon composed of 379 places in 0 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 857 place count 623 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 380 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 623 transition count 702
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 860 place count 621 transition count 700
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 862 place count 621 transition count 700
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -562
Deduced a syphon composed of 456 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 940 place count 621 transition count 1262
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1019 place count 542 transition count 1104
Deduced a syphon composed of 377 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1098 place count 542 transition count 1104
Deduced a syphon composed of 377 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1101 place count 542 transition count 1101
Deduced a syphon composed of 377 places in 1 ms
Applied a total of 1101 rules in 227 ms. Remains 542 /782 variables (removed 240) and now considering 1101/782 (removed -319) transitions.
[2024-05-29 20:34:36] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 1101 rows 542 cols
[2024-05-29 20:34:36] [INFO ] Computed 81 invariants in 7 ms
[2024-05-29 20:34:36] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 542/782 places, 1101/782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 542/782 places, 1101/782 transitions.
Built C files in :
/tmp/ltsmin17852529964143171693
[2024-05-29 20:34:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17852529964143171693
Running compilation step : cd /tmp/ltsmin17852529964143171693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1251 ms.
Running link step : cd /tmp/ltsmin17852529964143171693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17852529964143171693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1934542152501637919.hoa' '--buchi-type=spotba'
LTSmin run took 218 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-020B-LTLFireability-01 finished in 23710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 781 transition count 781
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 781 transition count 781
Applied a total of 26 rules in 27 ms. Remains 781 /794 variables (removed 13) and now considering 781/794 (removed 13) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-29 20:34:38] [INFO ] Computed 81 invariants in 8 ms
[2024-05-29 20:34:38] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 20:34:38] [INFO ] Invariant cache hit.
[2024-05-29 20:34:38] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-29 20:34:38] [INFO ] Invariant cache hit.
[2024-05-29 20:34:39] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/794 places, 781/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1103 ms. Remains : 781/794 places, 781/794 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s329 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 619 reset in 221 ms.
Product exploration explored 100000 steps with 629 reset in 270 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Detected a total of 238/781 stabilizing places and 238/781 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 273 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=136 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 20:34:40] [INFO ] Invariant cache hit.
[2024-05-29 20:34:40] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned sat
[2024-05-29 20:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:34:41] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2024-05-29 20:34:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:34:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2024-05-29 20:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:34:42] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2024-05-29 20:34:42] [INFO ] Computed and/alt/rep : 780/1141/780 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-29 20:34:52] [INFO ] Added : 770 causal constraints over 155 iterations in 9252 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 780 transition count 562
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 562 transition count 562
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 436 place count 562 transition count 401
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 758 place count 401 transition count 401
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 1110 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 1111 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 1113 place count 224 transition count 223
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 1231 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1233 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1234 place count 162 transition count 279
Applied a total of 1234 rules in 55 ms. Remains 162 /781 variables (removed 619) and now considering 279/781 (removed 502) transitions.
// Phase 1: matrix 279 rows 162 cols
[2024-05-29 20:34:52] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:34:52] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 20:34:52] [INFO ] Invariant cache hit.
[2024-05-29 20:34:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:34:52] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-29 20:34:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:34:52] [INFO ] Invariant cache hit.
[2024-05-29 20:34:52] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/781 places, 279/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 162/781 places, 279/781 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/162 stabilizing places and 2/279 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2024-05-29 20:34:53] [INFO ] Invariant cache hit.
[2024-05-29 20:34:53] [INFO ] [Real]Absence check using 80 positive place invariants in 14 ms returned sat
[2024-05-29 20:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:34:53] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-29 20:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:34:53] [INFO ] [Nat]Absence check using 80 positive place invariants in 14 ms returned sat
[2024-05-29 20:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:34:53] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-29 20:34:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:34:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-29 20:34:53] [INFO ] Computed and/alt/rep : 262/815/262 causal constraints (skipped 12 transitions) in 18 ms.
[2024-05-29 20:34:54] [INFO ] Added : 201 causal constraints over 41 iterations in 766 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-02 finished in 16083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(!p0)) U X(G(p1))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 781 transition count 781
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 781 transition count 781
Applied a total of 26 rules in 37 ms. Remains 781 /794 variables (removed 13) and now considering 781/794 (removed 13) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-29 20:34:54] [INFO ] Computed 81 invariants in 6 ms
[2024-05-29 20:34:54] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-29 20:34:54] [INFO ] Invariant cache hit.
[2024-05-29 20:34:54] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-05-29 20:34:54] [INFO ] Invariant cache hit.
[2024-05-29 20:34:55] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/794 places, 781/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1082 ms. Remains : 781/794 places, 781/794 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s267 1), p1:(EQ s778 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-04 finished in 1236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G((p1||(p2 U p0)))))) U p3))'
Support contains 4 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 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 793 transition count 577
Reduce places removed 216 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 433 place count 577 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 576 transition count 576
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 434 place count 576 transition count 421
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 753 place count 412 transition count 412
Iterating global reduction 3 with 9 rules applied. Total rules applied 762 place count 412 transition count 412
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 762 place count 412 transition count 405
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 776 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 1130 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 1131 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 1133 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 1249 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 1251 place count 167 transition count 280
Applied a total of 1251 rules in 81 ms. Remains 167 /794 variables (removed 627) and now considering 280/794 (removed 514) transitions.
// Phase 1: matrix 280 rows 167 cols
[2024-05-29 20:34:55] [INFO ] Computed 81 invariants in 2 ms
[2024-05-29 20:34:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 20:34:55] [INFO ] Invariant cache hit.
[2024-05-29 20:34:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:34:55] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-29 20:34:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:34:55] [INFO ] Invariant cache hit.
[2024-05-29 20:34:55] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/794 places, 280/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 167/794 places, 280/794 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p3), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s75 1), p0:(EQ s140 1), p1:(EQ s102 1), p2:(EQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-05 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 793 transition count 576
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 576 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 575 transition count 575
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 436 place count 575 transition count 421
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 754 place count 411 transition count 411
Iterating global reduction 3 with 10 rules applied. Total rules applied 764 place count 411 transition count 411
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 764 place count 411 transition count 403
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 780 place count 403 transition count 403
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1136 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1137 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 4 with 2 rules applied. Total rules applied 1139 place count 224 transition count 223
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 1255 place count 166 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1257 place count 164 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1258 place count 163 transition count 277
Applied a total of 1258 rules in 55 ms. Remains 163 /794 variables (removed 631) and now considering 277/794 (removed 517) transitions.
// Phase 1: matrix 277 rows 163 cols
[2024-05-29 20:34:56] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:34:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 20:34:56] [INFO ] Invariant cache hit.
[2024-05-29 20:34:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-29 20:34:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:34:56] [INFO ] Invariant cache hit.
[2024-05-29 20:34:56] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/794 places, 277/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 163/794 places, 277/794 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s60 1), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 66 reset in 385 ms.
Product exploration explored 100000 steps with 63 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:34:57] [INFO ] Invariant cache hit.
[2024-05-29 20:34:57] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:34:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2024-05-29 20:34:58] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:34:58] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 20:34:58] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 110 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-29 20:34:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 163/163 places, 277/277 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:34:59] [INFO ] Invariant cache hit.
[2024-05-29 20:34:59] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:34:59] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2024-05-29 20:34:59] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:34:59] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 20:34:59] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 122 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 57 reset in 338 ms.
Product exploration explored 100000 steps with 80 reset in 385 ms.
Built C files in :
/tmp/ltsmin1985490899182141316
[2024-05-29 20:35:00] [INFO ] Computing symmetric may disable matrix : 277 transitions.
[2024-05-29 20:35:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:00] [INFO ] Computing symmetric may enable matrix : 277 transitions.
[2024-05-29 20:35:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:00] [INFO ] Computing Do-Not-Accords matrix : 277 transitions.
[2024-05-29 20:35:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1985490899182141316
Running compilation step : cd /tmp/ltsmin1985490899182141316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin1985490899182141316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1985490899182141316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17639148702967384922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 277/277 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-29 20:35:15] [INFO ] Invariant cache hit.
[2024-05-29 20:35:15] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 20:35:15] [INFO ] Invariant cache hit.
[2024-05-29 20:35:15] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-29 20:35:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:35:15] [INFO ] Invariant cache hit.
[2024-05-29 20:35:15] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 163/163 places, 277/277 transitions.
Built C files in :
/tmp/ltsmin8173410620327572793
[2024-05-29 20:35:15] [INFO ] Computing symmetric may disable matrix : 277 transitions.
[2024-05-29 20:35:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:15] [INFO ] Computing symmetric may enable matrix : 277 transitions.
[2024-05-29 20:35:15] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:16] [INFO ] Computing Do-Not-Accords matrix : 277 transitions.
[2024-05-29 20:35:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:35:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8173410620327572793
Running compilation step : cd /tmp/ltsmin8173410620327572793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin8173410620327572793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8173410620327572793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16921507242277610787.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:35:31] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:35:31] [INFO ] Flatten gal took : 19 ms
[2024-05-29 20:35:31] [INFO ] Time to serialize gal into /tmp/LTL12658626376079639470.gal : 4 ms
[2024-05-29 20:35:31] [INFO ] Time to serialize properties into /tmp/LTL4910713542380438846.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12658626376079639470.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10016842084087247407.hoa' '-atoms' '/tmp/LTL4910713542380438846.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4910713542380438846.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10016842084087247407.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:35:46] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:35:46] [INFO ] Flatten gal took : 14 ms
[2024-05-29 20:35:46] [INFO ] Time to serialize gal into /tmp/LTL903680053402135134.gal : 3 ms
[2024-05-29 20:35:46] [INFO ] Time to serialize properties into /tmp/LTL9691203166368974613.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL903680053402135134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9691203166368974613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(p361==1)"))||(G("(p335==0)"))))
Formula 0 simplified : G!"(p361==1)" & F!"(p335==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:36:01] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:36:01] [INFO ] Applying decomposition
[2024-05-29 20:36:01] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5911021733508367792.txt' '-o' '/tmp/graph5911021733508367792.bin' '-w' '/tmp/graph5911021733508367792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5911021733508367792.bin' '-l' '-1' '-v' '-w' '/tmp/graph5911021733508367792.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:36:01] [INFO ] Decomposing Gal with order
[2024-05-29 20:36:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:36:01] [INFO ] Removed a total of 532 redundant transitions.
[2024-05-29 20:36:01] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 12 ms.
[2024-05-29 20:36:01] [INFO ] Time to serialize gal into /tmp/LTL895832587586196336.gal : 3 ms
[2024-05-29 20:36:01] [INFO ] Time to serialize properties into /tmp/LTL14895792439284925445.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL895832587586196336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14895792439284925445.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i2.i0.u28.p361==1)"))||(G("(i2.i0.u26.p335==0)"))))
Formula 0 simplified : G!"(i2.i0.u28.p361==1)" & F!"(i2.i0.u26.p335==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.093741,19176,1,0,6673,66,963,18128,98,111,8757
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-020B-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-020B-LTLFireability-06 finished in 65519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X((p1 U (p2||G(p1))))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 40 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-29 20:36:01] [INFO ] Computed 81 invariants in 7 ms
[2024-05-29 20:36:01] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 20:36:01] [INFO ] Invariant cache hit.
[2024-05-29 20:36:02] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2024-05-29 20:36:02] [INFO ] Invariant cache hit.
[2024-05-29 20:36:02] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1128 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
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=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s142 1), p2:(AND (NEQ s614 1) (NEQ s235 1)), p1:(NEQ s235 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 243 ms.
Stack based approach found an accepted trace after 593 steps with 0 reset with depth 594 and stack size 594 in 3 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-07 finished in 1567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p0&&G(p1)) U ((!p0&&X(p2)&&G(p1))||G((!p0&&G(p1)))))&&p3))))'
Support contains 5 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 34 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-29 20:36:03] [INFO ] Computed 81 invariants in 7 ms
[2024-05-29 20:36:03] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 20:36:03] [INFO ] Invariant cache hit.
[2024-05-29 20:36:04] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-29 20:36:04] [INFO ] Invariant cache hit.
[2024-05-29 20:36:04] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1128 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=4 dest: 2}, { cond=(OR (AND p1 p0) (AND p1 (NOT p3))), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s334 1), p0:(AND (EQ s259 1) (EQ s301 1) (EQ s327 1)), p3:(OR (EQ s259 0) (EQ s301 0) (EQ s327 0)), p2:(NEQ s34 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 259 ms.
Product exploration explored 100000 steps with 7 reset in 363 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 p1 (NOT p0) p3 p2), (X (NOT (OR (NOT p1) p0 (NOT p3)))), (X (AND p1 (NOT p0) p3)), (X (X (NOT (OR (NOT p1) p0 (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 236074 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236074 steps, saw 99050 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 20:36:09] [INFO ] Invariant cache hit.
[2024-05-29 20:36:09] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2024-05-29 20:36:09] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:36:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-29 20:36:10] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:36:10] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:36:10] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:36:10] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:36:10] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:36:10] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:36:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 667 ms
[2024-05-29 20:36:11] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 224 ms.
[2024-05-29 20:36:11] [INFO ] After 2127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 5 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 783/783 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 783 transition count 566
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 566 transition count 566
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 434 place count 566 transition count 409
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 748 place count 409 transition count 409
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 0 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 1112 place count 227 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 227 transition count 226
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 1115 place count 226 transition count 225
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1231 place count 168 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 1232 place count 168 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1233 place count 168 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1234 place count 167 transition count 278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1235 place count 167 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1236 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1237 place count 165 transition count 276
Applied a total of 1237 rules in 36 ms. Remains 165 /783 variables (removed 618) and now considering 276/783 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 165/783 places, 276/783 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 276 rows 165 cols
[2024-05-29 20:36:11] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:36:11] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2024-05-29 20:36:11] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:36:11] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2024-05-29 20:36:11] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:36:11] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 20:36:11] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 276/276 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 165/165 places, 276/276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 605699 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 605699 steps, saw 403695 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:36:15] [INFO ] Invariant cache hit.
[2024-05-29 20:36:15] [INFO ] [Real]Absence check using 80 positive place invariants in 15 ms returned sat
[2024-05-29 20:36:15] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:36:15] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:36:15] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:36:15] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 20:36:15] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 276/276 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 165/165 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 276/276 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-05-29 20:36:15] [INFO ] Invariant cache hit.
[2024-05-29 20:36:15] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 20:36:15] [INFO ] Invariant cache hit.
[2024-05-29 20:36:15] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-29 20:36:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:36:15] [INFO ] Invariant cache hit.
[2024-05-29 20:36:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 165/165 places, 276/276 transitions.
Graph (trivial) has 74 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 557 edges and 163 vertex of which 161 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 71 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 157 transition count 267
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 70 edges and 155 vertex of which 6 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 152 transition count 258
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 68 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 145 transition count 247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 64 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 137 transition count 233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 129 transition count 219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 121 transition count 205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 113 transition count 191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 105 transition count 177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 44 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 97 transition count 163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 40 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 89 transition count 149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 37 edges and 85 vertex of which 6 / 85 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 82 transition count 136
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 33 edges and 79 vertex of which 2 / 79 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 199 place count 78 transition count 127
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 203 place count 77 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 203 place count 77 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 206 place count 75 transition count 123
Graph (trivial) has 31 edges and 75 vertex of which 2 / 75 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 13 with 1 rules applied. Total rules applied 207 place count 74 transition count 123
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 209 place count 74 transition count 121
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 215 place count 74 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 215 place count 74 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 218 place count 72 transition count 114
Applied a total of 218 rules in 21 ms. Remains 72 /165 variables (removed 93) and now considering 114/276 (removed 162) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 114 rows 72 cols
[2024-05-29 20:36:15] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 20:36:15] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 20:36:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:36:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 20:36:15] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:36:15] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 20:36:15] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT (OR (NOT p1) p0 (NOT p3)))), (X (AND p1 (NOT p0) p3)), (X (X (NOT (OR (NOT p1) p0 (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (OR p0 (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 p3))), (F (OR (AND p0 p1) (AND p1 (NOT p3))))]
Knowledge based reduction with 10 factoid took 216 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Support contains 5 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 783/783 transitions.
Applied a total of 0 rules in 25 ms. Remains 783 /783 variables (removed 0) and now considering 783/783 (removed 0) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-29 20:36:16] [INFO ] Computed 81 invariants in 6 ms
[2024-05-29 20:36:16] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 20:36:16] [INFO ] Invariant cache hit.
[2024-05-29 20:36:17] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-29 20:36:17] [INFO ] Invariant cache hit.
[2024-05-29 20:36:17] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 783/783 places, 783/783 transitions.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (OR p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1 p3)), (X (X (NOT (OR p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 108 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 20:36:18] [INFO ] Invariant cache hit.
[2024-05-29 20:36:18] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-29 20:36:18] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:36:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-29 20:36:19] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:36:19] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:36:20] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:36:21] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:36:21] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:36:21] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:36:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2249 ms
[2024-05-29 20:36:21] [INFO ] After 2861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-29 20:36:21] [INFO ] After 3298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 45 ms.
Support contains 5 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 783/783 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 783 transition count 566
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 566 transition count 566
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 434 place count 566 transition count 409
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 748 place count 409 transition count 409
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 0 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 1112 place count 227 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 227 transition count 226
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 1115 place count 226 transition count 225
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1231 place count 168 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 1232 place count 168 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1233 place count 168 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1234 place count 167 transition count 278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1235 place count 167 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1236 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1237 place count 165 transition count 276
Applied a total of 1237 rules in 43 ms. Remains 165 /783 variables (removed 618) and now considering 276/783 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 165/783 places, 276/783 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 355370 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355370 steps, saw 233699 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 276 rows 165 cols
[2024-05-29 20:36:25] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:36:25] [INFO ] [Real]Absence check using 80 positive place invariants in 10 ms returned sat
[2024-05-29 20:36:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:36:25] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2024-05-29 20:36:25] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:36:25] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 20:36:25] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 165/165 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 276/276 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-05-29 20:36:25] [INFO ] Invariant cache hit.
[2024-05-29 20:36:25] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 20:36:25] [INFO ] Invariant cache hit.
[2024-05-29 20:36:25] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-29 20:36:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:36:25] [INFO ] Invariant cache hit.
[2024-05-29 20:36:25] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 165/165 places, 276/276 transitions.
Graph (trivial) has 74 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 557 edges and 163 vertex of which 161 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 71 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 157 transition count 267
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 70 edges and 155 vertex of which 6 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 152 transition count 258
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 68 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 145 transition count 247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 64 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 137 transition count 233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 129 transition count 219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 121 transition count 205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 113 transition count 191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 105 transition count 177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 44 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 97 transition count 163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 40 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 89 transition count 149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 37 edges and 85 vertex of which 6 / 85 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 82 transition count 136
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 33 edges and 79 vertex of which 2 / 79 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 199 place count 78 transition count 127
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 203 place count 77 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 203 place count 77 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 206 place count 75 transition count 123
Graph (trivial) has 31 edges and 75 vertex of which 2 / 75 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 13 with 1 rules applied. Total rules applied 207 place count 74 transition count 123
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 209 place count 74 transition count 121
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 215 place count 74 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 215 place count 74 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 218 place count 72 transition count 114
Applied a total of 218 rules in 24 ms. Remains 72 /165 variables (removed 93) and now considering 114/276 (removed 162) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 114 rows 72 cols
[2024-05-29 20:36:25] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 20:36:25] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 20:36:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:36:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 20:36:26] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:36:26] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 20:36:26] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (OR p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1 p3)), (X (X (NOT (OR p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 p3))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (OR p0 (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 p3)))]
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 263 ms.
Stack based approach found an accepted trace after 65891 steps with 5 reset with depth 58697 and stack size 33628 in 209 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-08 finished in 24154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 793 transition count 575
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 575 transition count 575
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 436 place count 575 transition count 419
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 748 place count 419 transition count 419
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 759 place count 408 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 770 place count 408 transition count 408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 770 place count 408 transition count 400
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 786 place count 400 transition count 400
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 1136 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 1137 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 1139 place count 224 transition count 223
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 1257 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1259 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1260 place count 162 transition count 279
Applied a total of 1260 rules in 47 ms. Remains 162 /794 variables (removed 632) and now considering 279/794 (removed 515) transitions.
// Phase 1: matrix 279 rows 162 cols
[2024-05-29 20:36:27] [INFO ] Computed 80 invariants in 2 ms
[2024-05-29 20:36:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 20:36:27] [INFO ] Invariant cache hit.
[2024-05-29 20:36:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:36:27] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-29 20:36:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:36:27] [INFO ] Invariant cache hit.
[2024-05-29 20:36:27] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/794 places, 279/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 162/794 places, 279/794 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-10 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 38 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-29 20:36:27] [INFO ] Computed 81 invariants in 6 ms
[2024-05-29 20:36:28] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 20:36:28] [INFO ] Invariant cache hit.
[2024-05-29 20:36:28] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-29 20:36:28] [INFO ] Invariant cache hit.
[2024-05-29 20:36:29] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 782/794 places, 782/794 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s51 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]]
Stuttering criterion allowed to conclude after 79774 steps with 1 reset in 194 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-11 finished in 1379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 43 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-29 20:36:29] [INFO ] Computed 81 invariants in 6 ms
[2024-05-29 20:36:29] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 20:36:29] [INFO ] Invariant cache hit.
[2024-05-29 20:36:30] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-29 20:36:30] [INFO ] Invariant cache hit.
[2024-05-29 20:36:30] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s715 1) (EQ s227 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17036 steps with 0 reset in 44 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-13 finished in 1268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 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 793 transition count 577
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 577 transition count 577
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 432 place count 577 transition count 421
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 754 place count 411 transition count 411
Iterating global reduction 2 with 10 rules applied. Total rules applied 764 place count 411 transition count 411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 764 place count 411 transition count 404
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 778 place count 404 transition count 404
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 1134 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1135 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 3 with 2 rules applied. Total rules applied 1137 place count 225 transition count 224
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 1253 place count 167 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1255 place count 165 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1256 place count 164 transition count 278
Applied a total of 1256 rules in 51 ms. Remains 164 /794 variables (removed 630) and now considering 278/794 (removed 516) transitions.
// Phase 1: matrix 278 rows 164 cols
[2024-05-29 20:36:30] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:36:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 20:36:30] [INFO ] Invariant cache hit.
[2024-05-29 20:36:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:36:30] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-29 20:36:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:36:30] [INFO ] Invariant cache hit.
[2024-05-29 20:36:31] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/794 places, 278/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 164/794 places, 278/794 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s123 1), p0:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-15 finished in 550 ms.
All properties solved by simple procedures.
Total runtime 147516 ms.

BK_STOP 1717014992038

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r373-tall-171683789700618"
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 ;