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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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-030B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717015133439

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-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:38:55] [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:38:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:38:55] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-29 20:38:55] [INFO ] Transformed 1503 places.
[2024-05-29 20:38:55] [INFO ] Transformed 1503 transitions.
[2024-05-29 20:38:55] [INFO ] Found NUPN structural information;
[2024-05-29 20:38:55] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-030B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 1182 transition count 1182
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 1182 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1181 transition count 1181
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1181 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 1180 transition count 1180
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 1180 transition count 1180
Applied a total of 646 rules in 382 ms. Remains 1180 /1503 variables (removed 323) and now considering 1180/1503 (removed 323) transitions.
// Phase 1: matrix 1180 rows 1180 cols
[2024-05-29 20:38:56] [INFO ] Computed 121 invariants in 28 ms
[2024-05-29 20:38:56] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-29 20:38:56] [INFO ] Invariant cache hit.
[2024-05-29 20:38:57] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-05-29 20:38:57] [INFO ] Invariant cache hit.
[2024-05-29 20:38:58] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1180/1503 places, 1180/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2402 ms. Remains : 1180/1503 places, 1180/1503 transitions.
Support contains 35 out of 1180 places after structural reductions.
[2024-05-29 20:38:58] [INFO ] Flatten gal took : 101 ms
[2024-05-29 20:38:58] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:38:58] [INFO ] Input system was already deterministic with 1180 transitions.
Support contains 32 out of 1180 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-29 20:38:59] [INFO ] Invariant cache hit.
[2024-05-29 20:38:59] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 20:39:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2024-05-29 20:39:01] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 20:39:01] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 5 ms to minimize.
[2024-05-29 20:39:01] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:39:02] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 2 ms to minimize.
[2024-05-29 20:39:02] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:39:02] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:39:02] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:39:02] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:39:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2587 ms
[2024-05-29 20:39:04] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:39:04] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:39:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2024-05-29 20:39:04] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:39:04] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:39:04] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:39:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 577 ms
[2024-05-29 20:39:05] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:39:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-29 20:39:05] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:39:05] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:39:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2024-05-29 20:39:06] [INFO ] After 5851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 517 ms.
[2024-05-29 20:39:06] [INFO ] After 6918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 296 ms.
Support contains 17 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1180 transition count 856
Reduce places removed 324 places and 0 transitions.
Iterating post reduction 1 with 324 rules applied. Total rules applied 648 place count 856 transition count 856
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 227 Pre rules applied. Total rules applied 648 place count 856 transition count 629
Deduced a syphon composed of 227 places in 1 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 2 with 454 rules applied. Total rules applied 1102 place count 629 transition count 629
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1108 place count 623 transition count 623
Iterating global reduction 2 with 6 rules applied. Total rules applied 1114 place count 623 transition count 623
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1114 place count 623 transition count 618
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1124 place count 618 transition count 618
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 1 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1662 place count 349 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1663 place count 349 transition count 348
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1665 place count 348 transition count 347
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1841 place count 260 transition count 431
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1842 place count 260 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1843 place count 259 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1844 place count 258 transition count 429
Applied a total of 1844 rules in 182 ms. Remains 258 /1180 variables (removed 922) and now considering 429/1180 (removed 751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 258/1180 places, 429/1180 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 429 rows 258 cols
[2024-05-29 20:39:07] [INFO ] Computed 120 invariants in 12 ms
[2024-05-29 20:39:07] [INFO ] [Real]Absence check using 120 positive place invariants in 18 ms returned sat
[2024-05-29 20:39:08] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 20:39:08] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2024-05-29 20:39:08] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 20:39:08] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-29 20:39:08] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 111 ms.
Support contains 15 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 429/429 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 258 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 257 transition count 428
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 255 transition count 430
Applied a total of 6 rules in 18 ms. Remains 255 /258 variables (removed 3) and now considering 430/429 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 255/258 places, 430/429 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 430 rows 255 cols
[2024-05-29 20:39:09] [INFO ] Computed 120 invariants in 3 ms
[2024-05-29 20:39:09] [INFO ] [Real]Absence check using 120 positive place invariants in 16 ms returned sat
[2024-05-29 20:39:09] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:39:09] [INFO ] [Nat]Absence check using 120 positive place invariants in 19 ms returned sat
[2024-05-29 20:39:09] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:39:09] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-29 20:39:09] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 129 ms.
Support contains 12 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 430/430 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 255 transition count 427
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 252 transition count 427
Applied a total of 6 rules in 12 ms. Remains 252 /255 variables (removed 3) and now considering 427/430 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 252/255 places, 427/430 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 238199 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{1=1}
Probabilistic random walk after 238199 steps, saw 160164 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 427 rows 252 cols
[2024-05-29 20:39:13] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:39:13] [INFO ] [Real]Absence check using 120 positive place invariants in 18 ms returned sat
[2024-05-29 20:39:13] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 20:39:13] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2024-05-29 20:39:14] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 20:39:14] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-29 20:39:14] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 427/427 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 252 transition count 424
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 249 transition count 424
Applied a total of 6 rules in 12 ms. Remains 249 /252 variables (removed 3) and now considering 424/427 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 249/252 places, 424/427 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 213421 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213421 steps, saw 139926 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 424 rows 249 cols
[2024-05-29 20:39:17] [INFO ] Computed 120 invariants in 10 ms
[2024-05-29 20:39:17] [INFO ] [Real]Absence check using 120 positive place invariants in 16 ms returned sat
[2024-05-29 20:39:18] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 20:39:18] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2024-05-29 20:39:18] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 20:39:18] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 20:39:18] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 83 ms.
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 424/424 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 423
Applied a total of 2 rules in 12 ms. Remains 248 /249 variables (removed 1) and now considering 423/424 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 248/249 places, 423/424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 283264 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283264 steps, saw 183197 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 423 rows 248 cols
[2024-05-29 20:39:21] [INFO ] Computed 120 invariants in 4 ms
[2024-05-29 20:39:21] [INFO ] [Real]Absence check using 120 positive place invariants in 16 ms returned sat
[2024-05-29 20:39:22] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:39:22] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2024-05-29 20:39:22] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:39:22] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 20:39:22] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 128 ms.
Support contains 8 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 423/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 248 /248 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 248/248 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 248 /248 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-05-29 20:39:22] [INFO ] Invariant cache hit.
[2024-05-29 20:39:22] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 20:39:22] [INFO ] Invariant cache hit.
[2024-05-29 20:39:23] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-29 20:39:23] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 20:39:23] [INFO ] Invariant cache hit.
[2024-05-29 20:39:23] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 248/248 places, 423/423 transitions.
Graph (trivial) has 114 edges and 248 vertex of which 4 / 248 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 849 edges and 246 vertex of which 244 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 111 edges and 242 vertex of which 4 / 242 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 240 transition count 414
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 110 edges and 238 vertex of which 6 / 238 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 235 transition count 405
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 108 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 228 transition count 394
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 104 edges and 224 vertex of which 8 / 224 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 220 transition count 380
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 100 edges and 216 vertex of which 8 / 216 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 212 transition count 366
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 96 edges and 208 vertex of which 8 / 208 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 204 transition count 352
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 92 edges and 200 vertex of which 8 / 200 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 196 transition count 338
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 88 edges and 192 vertex of which 8 / 192 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 188 transition count 324
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 84 edges and 184 vertex of which 8 / 184 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 180 transition count 310
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 80 edges and 176 vertex of which 8 / 176 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 172 transition count 296
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 76 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 164 transition count 282
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 72 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 156 transition count 268
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 68 edges and 152 vertex of which 8 / 152 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 148 transition count 254
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 144 vertex of which 8 / 144 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 140 transition count 240
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 136 vertex of which 8 / 136 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 132 transition count 226
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 128 vertex of which 8 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 124 transition count 212
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 120 vertex of which 8 / 120 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 116 transition count 198
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 48 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 108 transition count 184
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 104 vertex of which 8 / 104 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 100 transition count 170
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 96 vertex of which 8 / 96 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 92 transition count 156
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 36 edges and 88 vertex of which 8 / 88 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 84 transition count 142
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 32 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 76 transition count 128
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 28 edges and 72 vertex of which 8 / 72 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 68 transition count 114
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 24 edges and 64 vertex of which 8 / 64 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 60 transition count 100
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 20 edges and 56 vertex of which 6 / 56 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 53 transition count 86
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 16 edges and 50 vertex of which 4 / 50 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 14 rules applied. Total rules applied 467 place count 48 transition count 76
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 13 edges and 46 vertex of which 2 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 9 rules applied. Total rules applied 476 place count 45 transition count 70
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 5 rules applied. Total rules applied 481 place count 44 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 1 Pre rules applied. Total rules applied 481 place count 44 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 484 place count 42 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 487 place count 40 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 491 place count 40 transition count 60
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 29 with 9 rules applied. Total rules applied 500 place count 40 transition count 51
Applied a total of 500 rules in 62 ms. Remains 40 /248 variables (removed 208) and now considering 51/423 (removed 372) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 51 rows 40 cols
[2024-05-29 20:39:23] [INFO ] Computed 16 invariants in 0 ms
[2024-05-29 20:39:23] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-29 20:39:23] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:39:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-29 20:39:23] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:39:23] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 20:39:23] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 362 stabilizing places and 362 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' '!(G(F((p0||G(F(p1))))))'
Support contains 4 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1179 transition count 852
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 852 transition count 852
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 654 place count 852 transition count 618
Deduced a syphon composed of 234 places in 0 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1122 place count 618 transition count 618
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1131 place count 609 transition count 609
Iterating global reduction 2 with 9 rules applied. Total rules applied 1140 place count 609 transition count 609
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1140 place count 609 transition count 601
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1156 place count 601 transition count 601
Performed 264 Post agglomeration using F-continuation condition.Transition count delta: 264
Deduced a syphon composed of 264 places in 0 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 1684 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1685 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1863 place count 248 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1865 place count 246 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1866 place count 245 transition count 419
Applied a total of 1866 rules in 108 ms. Remains 245 /1180 variables (removed 935) and now considering 419/1180 (removed 761) transitions.
// Phase 1: matrix 419 rows 245 cols
[2024-05-29 20:39:23] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:39:24] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 20:39:24] [INFO ] Invariant cache hit.
[2024-05-29 20:39:24] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-29 20:39:24] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 20:39:24] [INFO ] Invariant cache hit.
[2024-05-29 20:39:24] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1180 places, 419/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 763 ms. Remains : 245/1180 places, 419/1180 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 416 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s100 1) (EQ s102 1) (EQ s106 1)), p1:(EQ s116 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21455 steps with 4 reset in 143 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-00 finished in 1382 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)))'
Support contains 2 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1172 transition count 1172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1172 transition count 1172
Applied a total of 16 rules in 66 ms. Remains 1172 /1180 variables (removed 8) and now considering 1172/1180 (removed 8) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:39:25] [INFO ] Computed 121 invariants in 13 ms
[2024-05-29 20:39:25] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 20:39:25] [INFO ] Invariant cache hit.
[2024-05-29 20:39:26] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2024-05-29 20:39:26] [INFO ] Invariant cache hit.
[2024-05-29 20:39:27] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1180 places, 1172/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1858 ms. Remains : 1172/1180 places, 1172/1180 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s729 1) (EQ s793 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-02 finished in 1947 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(p0)||X(p1)))'
Support contains 2 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1172 transition count 1172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1172 transition count 1172
Applied a total of 16 rules in 73 ms. Remains 1172 /1180 variables (removed 8) and now considering 1172/1180 (removed 8) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:39:27] [INFO ] Computed 121 invariants in 11 ms
[2024-05-29 20:39:27] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-29 20:39:27] [INFO ] Invariant cache hit.
[2024-05-29 20:39:28] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-29 20:39:28] [INFO ] Invariant cache hit.
[2024-05-29 20:39:29] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1180 places, 1172/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1889 ms. Remains : 1172/1180 places, 1172/1180 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s529 1), p0:(EQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-03 finished in 2084 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 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1179 transition count 850
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 850 transition count 850
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 658 place count 850 transition count 614
Deduced a syphon composed of 236 places in 0 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1130 place count 614 transition count 614
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1138 place count 606 transition count 606
Iterating global reduction 2 with 8 rules applied. Total rules applied 1146 place count 606 transition count 606
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1146 place count 606 transition count 599
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1160 place count 599 transition count 599
Performed 265 Post agglomeration using F-continuation condition.Transition count delta: 265
Deduced a syphon composed of 265 places in 0 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1690 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1691 place count 334 transition count 333
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1871 place count 244 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 242 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 241 transition count 417
Applied a total of 1874 rules in 82 ms. Remains 241 /1180 variables (removed 939) and now considering 417/1180 (removed 763) transitions.
// Phase 1: matrix 417 rows 241 cols
[2024-05-29 20:39:29] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:39:29] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-29 20:39:29] [INFO ] Invariant cache hit.
[2024-05-29 20:39:29] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-29 20:39:29] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:39:29] [INFO ] Invariant cache hit.
[2024-05-29 20:39:30] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/1180 places, 417/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 833 ms. Remains : 241/1180 places, 417/1180 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-04 finished in 991 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(G(p0)))'
Support contains 1 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1179 transition count 852
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 852 transition count 852
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 654 place count 852 transition count 616
Deduced a syphon composed of 236 places in 0 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1126 place count 616 transition count 616
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1134 place count 608 transition count 608
Iterating global reduction 2 with 8 rules applied. Total rules applied 1142 place count 608 transition count 608
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 608 transition count 600
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 600 transition count 600
Performed 265 Post agglomeration using F-continuation condition.Transition count delta: 265
Deduced a syphon composed of 265 places in 0 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1688 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1689 place count 335 transition count 334
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 334 transition count 333
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1869 place count 245 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1871 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1872 place count 242 transition count 419
Applied a total of 1872 rules in 79 ms. Remains 242 /1180 variables (removed 938) and now considering 419/1180 (removed 761) transitions.
// Phase 1: matrix 419 rows 242 cols
[2024-05-29 20:39:30] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:39:30] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 20:39:30] [INFO ] Invariant cache hit.
[2024-05-29 20:39:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:39:30] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-29 20:39:30] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:39:30] [INFO ] Invariant cache hit.
[2024-05-29 20:39:30] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1180 places, 419/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 242/1180 places, 419/1180 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s71 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-06 finished in 812 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((X(F(p0))||(p1 U p2)))))'
Support contains 2 out of 1180 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1172 transition count 1172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1172 transition count 1172
Applied a total of 16 rules in 75 ms. Remains 1172 /1180 variables (removed 8) and now considering 1172/1180 (removed 8) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:39:31] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:39:31] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-29 20:39:31] [INFO ] Invariant cache hit.
[2024-05-29 20:39:32] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2024-05-29 20:39:32] [INFO ] Invariant cache hit.
[2024-05-29 20:39:32] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1180 places, 1172/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 1172/1180 places, 1172/1180 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s339 1), p0:(EQ s1161 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1332 reset in 335 ms.
Product exploration explored 100000 steps with 1374 reset in 359 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1172 stabilizing places and 358/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-29 20:39:34] [INFO ] Invariant cache hit.
[2024-05-29 20:39:34] [INFO ] [Real]Absence check using 121 positive place invariants in 83 ms returned sat
[2024-05-29 20:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:39:37] [INFO ] [Real]Absence check using state equation in 2208 ms returned sat
[2024-05-29 20:39:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:39:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 80 ms returned sat
[2024-05-29 20:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:39:39] [INFO ] [Nat]Absence check using state equation in 2417 ms returned sat
[2024-05-29 20:39:40] [INFO ] Computed and/alt/rep : 1171/1712/1171 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-29 20:39:52] [INFO ] Added : 825 causal constraints over 165 iterations in 12057 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 1172 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Applied a total of 0 rules in 31 ms. Remains 1172 /1172 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-05-29 20:39:52] [INFO ] Invariant cache hit.
[2024-05-29 20:39:52] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-29 20:39:52] [INFO ] Invariant cache hit.
[2024-05-29 20:39:53] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2024-05-29 20:39:53] [INFO ] Invariant cache hit.
[2024-05-29 20:39:54] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1930 ms. Remains : 1172/1172 places, 1172/1172 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1172 stabilizing places and 358/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-29 20:39:54] [INFO ] Invariant cache hit.
[2024-05-29 20:39:55] [INFO ] [Real]Absence check using 121 positive place invariants in 72 ms returned sat
[2024-05-29 20:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:39:57] [INFO ] [Real]Absence check using state equation in 2171 ms returned sat
[2024-05-29 20:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:39:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 79 ms returned sat
[2024-05-29 20:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:40:00] [INFO ] [Nat]Absence check using state equation in 2468 ms returned sat
[2024-05-29 20:40:00] [INFO ] Computed and/alt/rep : 1171/1712/1171 causal constraints (skipped 0 transitions) in 65 ms.
[2024-05-29 20:40:12] [INFO ] Added : 830 causal constraints over 166 iterations in 12009 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1383 reset in 230 ms.
Product exploration explored 100000 steps with 1387 reset in 245 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 1172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1172 transition count 1172
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 122 Pre rules applied. Total rules applied 327 place count 1172 transition count 1293
Deduced a syphon composed of 449 places in 1 ms
Iterating global reduction 1 with 122 rules applied. Total rules applied 449 place count 1172 transition count 1293
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 807 places in 1 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 807 place count 1172 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 808 place count 1172 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1046 place count 934 transition count 1054
Deduced a syphon composed of 569 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1284 place count 934 transition count 1054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 570 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1285 place count 934 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1287 place count 932 transition count 1052
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1289 place count 932 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 669 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1390 place count 932 transition count 1784
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1491 place count 831 transition count 1582
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1592 place count 831 transition count 1582
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 586 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1610 place count 831 transition count 1704
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1629 place count 812 transition count 1666
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 1648 place count 812 transition count 1666
Deduced a syphon composed of 567 places in 0 ms
Applied a total of 1648 rules in 491 ms. Remains 812 /1172 variables (removed 360) and now considering 1666/1172 (removed -494) transitions.
[2024-05-29 20:40:13] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1666 rows 812 cols
[2024-05-29 20:40:13] [INFO ] Computed 121 invariants in 12 ms
[2024-05-29 20:40:14] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/1172 places, 1666/1172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1254 ms. Remains : 812/1172 places, 1666/1172 transitions.
Built C files in :
/tmp/ltsmin10875755131642553150
[2024-05-29 20:40:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10875755131642553150
Running compilation step : cd /tmp/ltsmin10875755131642553150;'/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 2013 ms.
Running link step : cd /tmp/ltsmin10875755131642553150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10875755131642553150;'/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/stateBased7865160135558668023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Applied a total of 0 rules in 29 ms. Remains 1172 /1172 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:40:29] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:40:29] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-29 20:40:29] [INFO ] Invariant cache hit.
[2024-05-29 20:40:30] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2024-05-29 20:40:30] [INFO ] Invariant cache hit.
[2024-05-29 20:40:31] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1977 ms. Remains : 1172/1172 places, 1172/1172 transitions.
Built C files in :
/tmp/ltsmin15358601584906889084
[2024-05-29 20:40:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15358601584906889084
Running compilation step : cd /tmp/ltsmin15358601584906889084;'/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 1919 ms.
Running link step : cd /tmp/ltsmin15358601584906889084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15358601584906889084;'/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/stateBased16351863402810479438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:40:46] [INFO ] Flatten gal took : 39 ms
[2024-05-29 20:40:46] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:40:46] [INFO ] Time to serialize gal into /tmp/LTL16036321953169656773.gal : 9 ms
[2024-05-29 20:40:46] [INFO ] Time to serialize properties into /tmp/LTL11973544306009401980.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/LTL16036321953169656773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14384753985794685568.hoa' '-atoms' '/tmp/LTL11973544306009401980.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...320
Loading property file /tmp/LTL11973544306009401980.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14384753985794685568.hoa
Detected timeout of ITS tools.
[2024-05-29 20:41:01] [INFO ] Flatten gal took : 34 ms
[2024-05-29 20:41:01] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:41:01] [INFO ] Time to serialize gal into /tmp/LTL14233751890493316171.gal : 5 ms
[2024-05-29 20:41:01] [INFO ] Time to serialize properties into /tmp/LTL3098327037625137840.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/LTL14233751890493316171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3098327037625137840.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(p1488==1)")))||(("(((p313==1)&&(p325==1))&&(p357==1))")U("(p427==1)"))))))
Formula 0 simplified : XG(XG!"(p1488==1)" & (!"(((p313==1)&&(p325==1))&&(p357==1))" R !"(p427==1)"))
Detected timeout of ITS tools.
[2024-05-29 20:41:16] [INFO ] Flatten gal took : 47 ms
[2024-05-29 20:41:16] [INFO ] Applying decomposition
[2024-05-29 20:41:16] [INFO ] Flatten gal took : 29 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/graph11060607555886351606.txt' '-o' '/tmp/graph11060607555886351606.bin' '-w' '/tmp/graph11060607555886351606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11060607555886351606.bin' '-l' '-1' '-v' '-w' '/tmp/graph11060607555886351606.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:41:17] [INFO ] Decomposing Gal with order
[2024-05-29 20:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:41:17] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-29 20:41:17] [INFO ] Flatten gal took : 98 ms
[2024-05-29 20:41:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 20:41:17] [INFO ] Time to serialize gal into /tmp/LTL10659141481785062905.gal : 21 ms
[2024-05-29 20:41:17] [INFO ] Time to serialize properties into /tmp/LTL5650899735728430975.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/LTL10659141481785062905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5650899735728430975.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(i30.i3.u456.p1488==1)")))||(("(((i8.i3.u99.p313==1)&&(i8.i4.u100.p325==1))&&(i9.i3.u114.p357==1))")U("(i2.i0.u134.p427==...164
Formula 0 simplified : XG(XG!"(i30.i3.u456.p1488==1)" & (!"(((i8.i3.u99.p313==1)&&(i8.i4.u100.p325==1))&&(i9.i3.u114.p357==1))" R !"(i2.i0.u134.p427==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17106109962551704787
[2024-05-29 20:41:32] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17106109962551704787
Running compilation step : cd /tmp/ltsmin17106109962551704787;'/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 1830 ms.
Running link step : cd /tmp/ltsmin17106109962551704787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17106109962551704787;'/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' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-030B-LTLFireability-07 finished in 136360 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(G(p0)))'
Support contains 1 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1179 transition count 851
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 851 transition count 851
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 656 place count 851 transition count 614
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1130 place count 614 transition count 614
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1139 place count 605 transition count 605
Iterating global reduction 2 with 9 rules applied. Total rules applied 1148 place count 605 transition count 605
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1148 place count 605 transition count 597
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 1164 place count 597 transition count 597
Performed 262 Post agglomeration using F-continuation condition.Transition count delta: 262
Deduced a syphon composed of 262 places in 0 ms
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 2 with 524 rules applied. Total rules applied 1688 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1689 place count 335 transition count 334
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 334 transition count 333
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1869 place count 245 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1871 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1872 place count 242 transition count 419
Applied a total of 1872 rules in 87 ms. Remains 242 /1180 variables (removed 938) and now considering 419/1180 (removed 761) transitions.
// Phase 1: matrix 419 rows 242 cols
[2024-05-29 20:41:47] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:41:47] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-29 20:41:47] [INFO ] Invariant cache hit.
[2024-05-29 20:41:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:41:48] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-29 20:41:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:48] [INFO ] Invariant cache hit.
[2024-05-29 20:41:48] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1180 places, 419/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 966 ms. Remains : 242/1180 places, 419/1180 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-08 finished in 1015 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 U (X(G(p0))||((p1 U p2)&&X((!p0 U p2))))))'
Support contains 7 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1171 transition count 1171
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1171 transition count 1171
Applied a total of 18 rules in 61 ms. Remains 1171 /1180 variables (removed 9) and now considering 1171/1180 (removed 9) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-29 20:41:48] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:41:48] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-29 20:41:48] [INFO ] Invariant cache hit.
[2024-05-29 20:41:49] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2024-05-29 20:41:49] [INFO ] Invariant cache hit.
[2024-05-29 20:41:50] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1180 places, 1171/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1879 ms. Remains : 1171/1180 places, 1171/1180 transitions.
Stuttering acceptance computed with spot in 373 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p2:(EQ s454 1), p1:(AND (EQ s137 1) (EQ s146 1) (EQ s171 1)), p0:(AND (EQ s500 1) (EQ s504 1) (EQ s517 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-09 finished in 2285 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(G((G(F(p0)) U p1))))'
Support contains 2 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1179 transition count 853
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 853 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 852 transition count 852
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 654 place count 852 transition count 616
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1126 place count 616 transition count 616
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1135 place count 607 transition count 607
Iterating global reduction 3 with 9 rules applied. Total rules applied 1144 place count 607 transition count 607
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1144 place count 607 transition count 599
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1160 place count 599 transition count 599
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 263
Deduced a syphon composed of 263 places in 0 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 1686 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1687 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1689 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1865 place count 247 transition count 420
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1866 place count 247 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1868 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1869 place count 244 transition count 418
Applied a total of 1869 rules in 99 ms. Remains 244 /1180 variables (removed 936) and now considering 418/1180 (removed 762) transitions.
// Phase 1: matrix 418 rows 244 cols
[2024-05-29 20:41:50] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:41:51] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-29 20:41:51] [INFO ] Invariant cache hit.
[2024-05-29 20:41:51] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-29 20:41:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:51] [INFO ] Invariant cache hit.
[2024-05-29 20:41:51] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/1180 places, 418/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 962 ms. Remains : 244/1180 places, 418/1180 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s153 1), p0:(NEQ s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-10 finished in 1106 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)))'
Support contains 1 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1179 transition count 850
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 850 transition count 850
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 658 place count 850 transition count 615
Deduced a syphon composed of 235 places in 0 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1128 place count 615 transition count 615
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1137 place count 606 transition count 606
Iterating global reduction 2 with 9 rules applied. Total rules applied 1146 place count 606 transition count 606
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1146 place count 606 transition count 598
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1162 place count 598 transition count 598
Performed 264 Post agglomeration using F-continuation condition.Transition count delta: 264
Deduced a syphon composed of 264 places in 0 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 1690 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1691 place count 334 transition count 333
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1871 place count 244 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 242 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 241 transition count 418
Applied a total of 1874 rules in 71 ms. Remains 241 /1180 variables (removed 939) and now considering 418/1180 (removed 762) transitions.
// Phase 1: matrix 418 rows 241 cols
[2024-05-29 20:41:51] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:41:52] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 20:41:52] [INFO ] Invariant cache hit.
[2024-05-29 20:41:52] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-29 20:41:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:52] [INFO ] Invariant cache hit.
[2024-05-29 20:41:52] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/1180 places, 418/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 717 ms. Remains : 241/1180 places, 418/1180 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-12 finished in 808 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 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1171 transition count 1171
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1171 transition count 1171
Applied a total of 18 rules in 67 ms. Remains 1171 /1180 variables (removed 9) and now considering 1171/1180 (removed 9) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-29 20:41:52] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:41:52] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-29 20:41:52] [INFO ] Invariant cache hit.
[2024-05-29 20:41:53] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2024-05-29 20:41:53] [INFO ] Invariant cache hit.
[2024-05-29 20:41:54] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1180 places, 1171/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1750 ms. Remains : 1171/1180 places, 1171/1180 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-13 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 s802 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 11280 steps with 2 reset in 41 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-13 finished in 1881 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((p0||(X(p1)&&F((p2 U (G(p2)||(p2&&G(!p1)))))))))'
Support contains 5 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1172 transition count 1172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1172 transition count 1172
Applied a total of 16 rules in 54 ms. Remains 1172 /1180 variables (removed 8) and now considering 1172/1180 (removed 8) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:41:54] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 20:41:54] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 20:41:54] [INFO ] Invariant cache hit.
[2024-05-29 20:41:55] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-05-29 20:41:55] [INFO ] Invariant cache hit.
[2024-05-29 20:41:56] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1180 places, 1172/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1857 ms. Remains : 1172/1180 places, 1172/1180 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND p1 (NOT p2)), true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s82 1) (EQ s108 1)), p1:(EQ s171 1), p2:(NEQ s227 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-14 finished in 2050 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(G((X(p0) U p1))) U X(p2)))'
Support contains 3 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1173 transition count 1173
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1173 transition count 1173
Applied a total of 14 rules in 66 ms. Remains 1173 /1180 variables (removed 7) and now considering 1173/1180 (removed 7) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-29 20:41:56] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 20:41:56] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 20:41:56] [INFO ] Invariant cache hit.
[2024-05-29 20:41:57] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-29 20:41:57] [INFO ] Invariant cache hit.
[2024-05-29 20:41:58] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1180 places, 1173/1180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1824 ms. Remains : 1173/1180 places, 1173/1180 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s594 1), p1:(AND (EQ s122 1) (EQ s594 1)), p0:(EQ s708 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25450 steps with 0 reset in 99 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-15 finished in 2093 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((X(F(p0))||(p1 U p2)))))'
Found a Shortening insensitive property : ShieldRVt-PT-030B-LTLFireability-07
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 1180 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 1180/1180 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1179 transition count 852
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 852 transition count 852
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 654 place count 852 transition count 617
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1124 place count 617 transition count 617
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1132 place count 609 transition count 609
Iterating global reduction 2 with 8 rules applied. Total rules applied 1140 place count 609 transition count 609
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1140 place count 609 transition count 602
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1154 place count 602 transition count 602
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 263
Deduced a syphon composed of 263 places in 0 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 2 with 526 rules applied. Total rules applied 1680 place count 339 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 339 transition count 338
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 1683 place count 338 transition count 337
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1861 place count 249 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1863 place count 247 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1864 place count 246 transition count 422
Applied a total of 1864 rules in 68 ms. Remains 246 /1180 variables (removed 934) and now considering 422/1180 (removed 758) transitions.
// Phase 1: matrix 422 rows 246 cols
[2024-05-29 20:41:58] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:41:59] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-29 20:41:59] [INFO ] Invariant cache hit.
[2024-05-29 20:41:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:41:59] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-29 20:41:59] [INFO ] Invariant cache hit.
[2024-05-29 20:41:59] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 246/1180 places, 422/1180 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 774 ms. Remains : 246/1180 places, 422/1180 transitions.
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s70 1), p0:(EQ s243 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30386 reset in 379 ms.
Product exploration explored 100000 steps with 30404 reset in 409 ms.
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/246 stabilizing places and 2/422 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-29 20:42:01] [INFO ] Invariant cache hit.
[2024-05-29 20:42:01] [INFO ] [Real]Absence check using 120 positive place invariants in 25 ms returned sat
[2024-05-29 20:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:42:01] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-29 20:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:42:01] [INFO ] [Nat]Absence check using 120 positive place invariants in 25 ms returned sat
[2024-05-29 20:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:42:01] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-29 20:42:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:42:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2024-05-29 20:42:01] [INFO ] Computed and/alt/rep : 405/1261/405 causal constraints (skipped 12 transitions) in 26 ms.
[2024-05-29 20:42:03] [INFO ] Added : 320 causal constraints over 65 iterations in 2003 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 2 out of 246 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 246 /246 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-05-29 20:42:03] [INFO ] Invariant cache hit.
[2024-05-29 20:42:04] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 20:42:04] [INFO ] Invariant cache hit.
[2024-05-29 20:42:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:42:04] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-29 20:42:04] [INFO ] Invariant cache hit.
[2024-05-29 20:42:04] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 246/246 places, 422/422 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/246 stabilizing places and 2/422 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-29 20:42:05] [INFO ] Invariant cache hit.
[2024-05-29 20:42:05] [INFO ] [Real]Absence check using 120 positive place invariants in 26 ms returned sat
[2024-05-29 20:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:42:05] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-29 20:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:42:05] [INFO ] [Nat]Absence check using 120 positive place invariants in 28 ms returned sat
[2024-05-29 20:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:42:06] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-29 20:42:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:42:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2024-05-29 20:42:06] [INFO ] Computed and/alt/rep : 405/1261/405 causal constraints (skipped 12 transitions) in 28 ms.
[2024-05-29 20:42:08] [INFO ] Added : 320 causal constraints over 65 iterations in 2053 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 30249 reset in 374 ms.
Stack based approach found an accepted trace after 22539 steps with 6928 reset with depth 9 and stack size 9 in 95 ms.
Treatment of property ShieldRVt-PT-030B-LTLFireability-07 finished in 10141 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 20:42:08] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2906146477916963252
[2024-05-29 20:42:08] [INFO ] Applying decomposition
[2024-05-29 20:42:08] [INFO ] Computing symmetric may disable matrix : 1180 transitions.
[2024-05-29 20:42:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:42:08] [INFO ] Computing symmetric may enable matrix : 1180 transitions.
[2024-05-29 20:42:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:42:08] [INFO ] Flatten gal took : 25 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/graph16710177077537721010.txt' '-o' '/tmp/graph16710177077537721010.bin' '-w' '/tmp/graph16710177077537721010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16710177077537721010.bin' '-l' '-1' '-v' '-w' '/tmp/graph16710177077537721010.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:42:08] [INFO ] Decomposing Gal with order
[2024-05-29 20:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:42:09] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-29 20:42:09] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 20:42:09] [INFO ] Time to serialize gal into /tmp/LTLFireability3109821137962121486.gal : 15 ms
[2024-05-29 20:42:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8925404147923106376.ltl : 1 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/LTLFireability3109821137962121486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8925404147923106376.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...276
Read 1 LTL properties
[2024-05-29 20:42:09] [INFO ] Computing Do-Not-Accords matrix : 1180 transitions.
[2024-05-29 20:42:09] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:42:09] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2906146477916963252
Running compilation step : cd /tmp/ltsmin2906146477916963252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((X(F((X(F("(i29.i4.u461.p1488==1)")))||(("(((i7.i3.u100.p313==1)&&(i7.i4.u102.p325==1))&&(i8.i3.u114.p357==1))")U("(i9.i0.u135.p427=...165
Formula 0 simplified : XG(XG!"(i29.i4.u461.p1488==1)" & (!"(((i7.i3.u100.p313==1)&&(i7.i4.u102.p325==1))&&(i8.i3.u114.p357==1))" R !"(i9.i0.u135.p427==1)")...156
Compilation finished in 3421 ms.
Running link step : cd /tmp/ltsmin2906146477916963252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2906146477916963252;'/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' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1061, t1063, t1065, t1067, t1069, t1071, t1073, t1075, t1077, t1079, t1081, t1083, t1085, t1...4060
Computing Next relation with stutter on 7.36211e+22 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
18047 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,180.618,1933740,1,0,2.35264e+06,1194,10387,8.86653e+06,284,3594,721298
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-030B-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 597926 ms.

BK_STOP 1717015734277

--------------------
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-030B"
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-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789800628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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