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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 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 489K 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-040B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717015516396

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 20:45:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:45:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:45:18] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-29 20:45:18] [INFO ] Transformed 2003 places.
[2024-05-29 20:45:18] [INFO ] Transformed 2003 transitions.
[2024-05-29 20:45:18] [INFO ] Found NUPN structural information;
[2024-05-29 20:45:18] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 426 places :
Symmetric choice reduction at 0 with 426 rule applications. Total rules 426 place count 1577 transition count 1577
Iterating global reduction 0 with 426 rules applied. Total rules applied 852 place count 1577 transition count 1577
Applied a total of 852 rules in 389 ms. Remains 1577 /2003 variables (removed 426) and now considering 1577/2003 (removed 426) transitions.
// Phase 1: matrix 1577 rows 1577 cols
[2024-05-29 20:45:19] [INFO ] Computed 161 invariants in 38 ms
[2024-05-29 20:45:19] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-29 20:45:19] [INFO ] Invariant cache hit.
[2024-05-29 20:45:21] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-05-29 20:45:21] [INFO ] Invariant cache hit.
[2024-05-29 20:45:22] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1577/2003 places, 1577/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3320 ms. Remains : 1577/2003 places, 1577/2003 transitions.
Support contains 33 out of 1577 places after structural reductions.
[2024-05-29 20:45:22] [INFO ] Flatten gal took : 120 ms
[2024-05-29 20:45:22] [INFO ] Flatten gal took : 69 ms
[2024-05-29 20:45:22] [INFO ] Input system was already deterministic with 1577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 20:45:23] [INFO ] Invariant cache hit.
[2024-05-29 20:45:23] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:45:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 59 ms returned sat
[2024-05-29 20:45:25] [INFO ] After 1362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:45:26] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 8 ms to minimize.
[2024-05-29 20:45:26] [INFO ] Deduced a trap composed of 24 places in 352 ms of which 4 ms to minimize.
[2024-05-29 20:45:26] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 2 ms to minimize.
[2024-05-29 20:45:27] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 15 ms to minimize.
[2024-05-29 20:45:27] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 10 ms to minimize.
[2024-05-29 20:45:28] [INFO ] Deduced a trap composed of 27 places in 499 ms of which 1 ms to minimize.
[2024-05-29 20:45:28] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:45:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2728 ms
[2024-05-29 20:45:28] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 1 ms to minimize.
[2024-05-29 20:45:29] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:45:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2024-05-29 20:45:29] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:45:29] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:45:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2024-05-29 20:45:30] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2024-05-29 20:45:30] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-05-29 20:45:31] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 3 ms to minimize.
[2024-05-29 20:45:31] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:45:31] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:45:32] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:45:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1193 ms
[2024-05-29 20:45:32] [INFO ] After 7905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 632 ms.
[2024-05-29 20:45:32] [INFO ] After 9225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 253 ms.
Support contains 16 out of 1577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 1577 transition count 1144
Reduce places removed 433 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 434 rules applied. Total rules applied 867 place count 1144 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 868 place count 1143 transition count 1143
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 868 place count 1143 transition count 832
Deduced a syphon composed of 311 places in 3 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1490 place count 832 transition count 832
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1493 place count 829 transition count 829
Iterating global reduction 3 with 3 rules applied. Total rules applied 1496 place count 829 transition count 829
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1496 place count 829 transition count 826
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1502 place count 826 transition count 826
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 1 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2226 place count 464 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 464 transition count 463
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 4 with 2 rules applied. Total rules applied 2229 place count 463 transition count 462
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2431 place count 362 transition count 557
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2463 place count 346 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2464 place count 346 transition count 572
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2466 place count 346 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2468 place count 344 transition count 570
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2470 place count 344 transition count 568
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2472 place count 344 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 343 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2474 place count 342 transition count 567
Applied a total of 2474 rules in 362 ms. Remains 342 /1577 variables (removed 1235) and now considering 567/1577 (removed 1010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 342/1577 places, 567/1577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 567 rows 342 cols
[2024-05-29 20:45:34] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:45:34] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 20:45:34] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-29 20:45:34] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 20:45:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-29 20:45:34] [INFO ] After 156ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 20:45:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-29 20:45:35] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 20:45:35] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 214 ms.
Support contains 10 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 567/567 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 342 transition count 564
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 339 transition count 564
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 338 transition count 563
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 336 transition count 563
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 336 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 335 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 334 transition count 561
Applied a total of 15 rules in 58 ms. Remains 334 /342 variables (removed 8) and now considering 561/567 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 334/342 places, 561/567 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 202501 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202501 steps, saw 133744 distinct states, run finished after 3003 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 561 rows 334 cols
[2024-05-29 20:45:39] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:45:39] [INFO ] [Real]Absence check using 160 positive place invariants in 23 ms returned sat
[2024-05-29 20:45:39] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:45:39] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2024-05-29 20:45:39] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:45:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-29 20:45:39] [INFO ] After 120ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 20:45:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-29 20:45:39] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 20:45:40] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 266 ms.
Support contains 10 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 561/561 transitions.
Applied a total of 0 rules in 12 ms. Remains 334 /334 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 334/334 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 561/561 transitions.
Applied a total of 0 rules in 12 ms. Remains 334 /334 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-29 20:45:40] [INFO ] Invariant cache hit.
[2024-05-29 20:45:40] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-29 20:45:40] [INFO ] Invariant cache hit.
[2024-05-29 20:45:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-29 20:45:41] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-05-29 20:45:41] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-29 20:45:41] [INFO ] Invariant cache hit.
[2024-05-29 20:45:41] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 334/334 places, 561/561 transitions.
Graph (trivial) has 152 edges and 334 vertex of which 4 / 334 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1137 edges and 332 vertex of which 330 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 149 edges and 328 vertex of which 4 / 328 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 326 transition count 552
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 148 edges and 324 vertex of which 6 / 324 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 321 transition count 543
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 146 edges and 318 vertex of which 8 / 318 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 314 transition count 532
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 142 edges and 310 vertex of which 8 / 310 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 306 transition count 518
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 138 edges and 302 vertex of which 8 / 302 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 298 transition count 504
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 134 edges and 294 vertex of which 8 / 294 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 290 transition count 490
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 130 edges and 286 vertex of which 8 / 286 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 282 transition count 476
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 126 edges and 278 vertex of which 8 / 278 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 274 transition count 462
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 122 edges and 270 vertex of which 8 / 270 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 266 transition count 448
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 118 edges and 262 vertex of which 8 / 262 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 258 transition count 434
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 114 edges and 254 vertex of which 8 / 254 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 250 transition count 420
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 110 edges and 246 vertex of which 8 / 246 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 242 transition count 406
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 106 edges and 238 vertex of which 8 / 238 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 234 transition count 392
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 102 edges and 230 vertex of which 8 / 230 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 226 transition count 378
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 222 vertex of which 8 / 222 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 218 transition count 364
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 214 vertex of which 8 / 214 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 210 transition count 350
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 90 edges and 206 vertex of which 8 / 206 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 202 transition count 336
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 86 edges and 198 vertex of which 8 / 198 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 194 transition count 322
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 82 edges and 190 vertex of which 4 / 190 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 188 transition count 308
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 79 edges and 186 vertex of which 2 / 186 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 11 rules applied. Total rules applied 350 place count 185 transition count 300
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 78 edges and 184 vertex of which 2 / 184 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 20 with 5 rules applied. Total rules applied 355 place count 183 transition count 297
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.
Graph (trivial) has 77 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 6 rules applied. Total rules applied 361 place count 181 transition count 293
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 365 place count 180 transition count 290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 2 Pre rules applied. Total rules applied 365 place count 180 transition count 288
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 369 place count 178 transition count 288
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 23 with 3 rules applied. Total rules applied 372 place count 176 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 375 place count 176 transition count 284
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 377 place count 176 transition count 282
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 24 with 5 rules applied. Total rules applied 382 place count 176 transition count 282
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 24 with 4 rules applied. Total rules applied 386 place count 176 transition count 278
Applied a total of 386 rules in 82 ms. Remains 176 /334 variables (removed 158) and now considering 278/561 (removed 283) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 278 rows 176 cols
[2024-05-29 20:45:41] [INFO ] Computed 82 invariants in 3 ms
[2024-05-29 20:45:41] [INFO ] [Real]Absence check using 82 positive place invariants in 10 ms returned sat
[2024-05-29 20:45:41] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:45:41] [INFO ] [Nat]Absence check using 82 positive place invariants in 10 ms returned sat
[2024-05-29 20:45:41] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:45:41] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 20:45:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-29 20:45:41] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 20:45:41] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 483 stabilizing places and 483 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' '!(X(X(F(p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1567 transition count 1567
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1567 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1566 transition count 1566
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1566 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1565 transition count 1565
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1565 transition count 1565
Applied a total of 24 rules in 213 ms. Remains 1565 /1577 variables (removed 12) and now considering 1565/1577 (removed 12) transitions.
// Phase 1: matrix 1565 rows 1565 cols
[2024-05-29 20:45:42] [INFO ] Computed 161 invariants in 11 ms
[2024-05-29 20:45:42] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-29 20:45:42] [INFO ] Invariant cache hit.
[2024-05-29 20:45:44] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2024-05-29 20:45:44] [INFO ] Invariant cache hit.
[2024-05-29 20:45:44] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1565/1577 places, 1565/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 1565/1577 places, 1565/1577 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 261 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1103 0) (EQ s636 1) (EQ s967 0) (EQ s1015 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 33333 reset in 730 ms.
Product exploration explored 100000 steps with 33333 reset in 658 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLCardinality-01 finished in 4450 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 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1576 transition count 1131
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 1131 transition count 1131
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 890 place count 1131 transition count 820
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1520 place count 812 transition count 812
Iterating global reduction 2 with 8 rules applied. Total rules applied 1528 place count 812 transition count 812
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1528 place count 812 transition count 806
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1540 place count 806 transition count 806
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 0 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 2262 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 445 transition count 444
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 2265 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2467 place count 343 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2503 place count 325 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2505 place count 323 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2506 place count 322 transition count 558
Applied a total of 2506 rules in 167 ms. Remains 322 /1577 variables (removed 1255) and now considering 558/1577 (removed 1019) transitions.
// Phase 1: matrix 558 rows 322 cols
[2024-05-29 20:45:46] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:45:47] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 20:45:47] [INFO ] Invariant cache hit.
[2024-05-29 20:45:47] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-29 20:45:47] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 20:45:47] [INFO ] Invariant cache hit.
[2024-05-29 20:45:47] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1577 places, 558/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1012 ms. Remains : 322/1577 places, 558/1577 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s179 0) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-02 finished in 1057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(!p0) U p1))&&X(G(p2)))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1576 transition count 1134
Reduce places removed 442 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 1134 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 886 place count 1133 transition count 1133
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 886 place count 1133 transition count 823
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1514 place count 815 transition count 815
Iterating global reduction 3 with 8 rules applied. Total rules applied 1522 place count 815 transition count 815
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1522 place count 815 transition count 809
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1534 place count 809 transition count 809
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2254 place count 449 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 449 transition count 448
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 2257 place count 448 transition count 447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 347 transition count 547
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2495 place count 329 transition count 565
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2497 place count 327 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2498 place count 326 transition count 563
Applied a total of 2498 rules in 156 ms. Remains 326 /1577 variables (removed 1251) and now considering 563/1577 (removed 1014) transitions.
// Phase 1: matrix 563 rows 326 cols
[2024-05-29 20:45:47] [INFO ] Computed 160 invariants in 4 ms
[2024-05-29 20:45:48] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 20:45:48] [INFO ] Invariant cache hit.
[2024-05-29 20:45:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:45:48] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2024-05-29 20:45:48] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:45:48] [INFO ] Invariant cache hit.
[2024-05-29 20:45:48] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1577 places, 563/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 960 ms. Remains : 326/1577 places, 563/1577 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 2} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0, 2} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(NOT p0), acceptance={1, 2} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s298 1), p1:(EQ s169 1), p2:(OR (EQ s123 0) (EQ s233 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 1241 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&&X(p1)))&&F(p2)))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1564 transition count 1564
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Applied a total of 30 rules in 193 ms. Remains 1562 /1577 variables (removed 15) and now considering 1562/1577 (removed 15) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:45:49] [INFO ] Computed 161 invariants in 15 ms
[2024-05-29 20:45:49] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-29 20:45:49] [INFO ] Invariant cache hit.
[2024-05-29 20:45:50] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2024-05-29 20:45:50] [INFO ] Invariant cache hit.
[2024-05-29 20:45:51] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1577 places, 1562/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2710 ms. Remains : 1562/1577 places, 1562/1577 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1086 0) (EQ s658 1)), p2:(AND (EQ s634 0) (EQ s1052 1)), p1:(OR (EQ s1052 0) (EQ s634 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30636 steps with 153 reset in 131 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-07 finished in 3061 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((p0&&F(G(p0)))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1565 transition count 1565
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1565 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1564 transition count 1564
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Applied a total of 28 rules in 195 ms. Remains 1563 /1577 variables (removed 14) and now considering 1563/1577 (removed 14) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2024-05-29 20:45:52] [INFO ] Computed 161 invariants in 10 ms
[2024-05-29 20:45:52] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-29 20:45:52] [INFO ] Invariant cache hit.
[2024-05-29 20:45:53] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-05-29 20:45:53] [INFO ] Invariant cache hit.
[2024-05-29 20:45:54] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1577 places, 1563/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 1563/1577 places, 1563/1577 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1350 0) (EQ s1031 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 460 ms.
Stack based approach found an accepted trace after 3694 steps with 0 reset with depth 3695 and stack size 3613 in 24 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 3419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p1))&&p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1563 transition count 1563
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1561 transition count 1561
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1561 transition count 1561
Applied a total of 32 rules in 272 ms. Remains 1561 /1577 variables (removed 16) and now considering 1561/1577 (removed 16) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-29 20:45:55] [INFO ] Computed 161 invariants in 9 ms
[2024-05-29 20:45:56] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-29 20:45:56] [INFO ] Invariant cache hit.
[2024-05-29 20:45:57] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2024-05-29 20:45:57] [INFO ] Invariant cache hit.
[2024-05-29 20:45:58] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1577 places, 1561/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2770 ms. Remains : 1561/1577 places, 1561/1577 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s182 0) (EQ s734 1) (OR (EQ s832 0) (EQ s195 1))), p1:(AND (EQ s182 0) (EQ s734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-10 finished in 3022 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(G(p0))&&F((p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1576 transition count 1135
Reduce places removed 441 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 442 rules applied. Total rules applied 883 place count 1135 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 884 place count 1134 transition count 1134
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 884 place count 1134 transition count 823
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1513 place count 816 transition count 816
Iterating global reduction 3 with 7 rules applied. Total rules applied 1520 place count 816 transition count 816
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1520 place count 816 transition count 810
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2248 place count 452 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2249 place count 452 transition count 451
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 2251 place count 451 transition count 450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2453 place count 350 transition count 549
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2489 place count 332 transition count 567
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2490 place count 332 transition count 567
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2492 place count 330 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2493 place count 329 transition count 565
Applied a total of 2493 rules in 178 ms. Remains 329 /1577 variables (removed 1248) and now considering 565/1577 (removed 1012) transitions.
// Phase 1: matrix 565 rows 329 cols
[2024-05-29 20:45:58] [INFO ] Computed 160 invariants in 1 ms
[2024-05-29 20:45:59] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 20:45:59] [INFO ] Invariant cache hit.
[2024-05-29 20:45:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 20:45:59] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-29 20:45:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:45:59] [INFO ] Invariant cache hit.
[2024-05-29 20:45:59] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 329/1577 places, 565/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1353 ms. Remains : 329/1577 places, 565/1577 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s254 0) (EQ s102 1)), p1:(AND (EQ s129 0) (EQ s55 1)), p2:(OR (EQ s24 0) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-11 finished in 1498 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&&(p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1576 transition count 1139
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1138 transition count 1138
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 876 place count 1138 transition count 826
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1500 place count 826 transition count 826
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1509 place count 817 transition count 817
Iterating global reduction 3 with 9 rules applied. Total rules applied 1518 place count 817 transition count 817
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1518 place count 817 transition count 810
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2246 place count 453 transition count 453
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2448 place count 352 transition count 553
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2484 place count 334 transition count 571
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2486 place count 334 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2488 place count 332 transition count 569
Applied a total of 2488 rules in 155 ms. Remains 332 /1577 variables (removed 1245) and now considering 569/1577 (removed 1008) transitions.
// Phase 1: matrix 569 rows 332 cols
[2024-05-29 20:46:00] [INFO ] Computed 161 invariants in 1 ms
[2024-05-29 20:46:00] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-29 20:46:00] [INFO ] Invariant cache hit.
[2024-05-29 20:46:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:46:00] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-29 20:46:00] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:46:00] [INFO ] Invariant cache hit.
[2024-05-29 20:46:01] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 332/1577 places, 569/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1251 ms. Remains : 332/1577 places, 569/1577 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s53 0) (NEQ s236 1)), p0:(OR (EQ s158 0) (EQ s177 1)), p2:(AND (NEQ s323 0) (NEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 1341 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 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1576 transition count 1132
Reduce places removed 444 places and 0 transitions.
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1132 transition count 1132
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 888 place count 1132 transition count 820
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1521 place count 811 transition count 811
Iterating global reduction 2 with 9 rules applied. Total rules applied 1530 place count 811 transition count 811
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1530 place count 811 transition count 804
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 1544 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2258 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2259 place count 447 transition count 446
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 2261 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2463 place count 345 transition count 545
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2499 place count 327 transition count 563
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2501 place count 325 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2502 place count 324 transition count 561
Applied a total of 2502 rules in 154 ms. Remains 324 /1577 variables (removed 1253) and now considering 561/1577 (removed 1016) transitions.
// Phase 1: matrix 561 rows 324 cols
[2024-05-29 20:46:01] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:46:01] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-29 20:46:01] [INFO ] Invariant cache hit.
[2024-05-29 20:46:01] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-29 20:46:02] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-29 20:46:02] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 20:46:02] [INFO ] Invariant cache hit.
[2024-05-29 20:46:02] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1577 places, 561/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1520 ms. Remains : 324/1577 places, 561/1577 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-15 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:(OR (EQ s1 0) (EQ s7 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 8 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-15 finished in 1620 ms.
All properties solved by simple procedures.
Total runtime 44552 ms.

BK_STOP 1717015563884

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-040B"
export BK_EXAMINATION="LTLCardinality"
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-040B, examination is LTLCardinality"
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-171683789800637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;