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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 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 614K 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-050B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717015980349

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-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:53:02] [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:53:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:53:02] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-29 20:53:02] [INFO ] Transformed 2503 places.
[2024-05-29 20:53:02] [INFO ] Transformed 2503 transitions.
[2024-05-29 20:53:02] [INFO ] Found NUPN structural information;
[2024-05-29 20:53:02] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA ShieldRVt-PT-050B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 536 places :
Symmetric choice reduction at 0 with 536 rule applications. Total rules 536 place count 1967 transition count 1967
Iterating global reduction 0 with 536 rules applied. Total rules applied 1072 place count 1967 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1073 place count 1966 transition count 1966
Iterating global reduction 0 with 1 rules applied. Total rules applied 1074 place count 1966 transition count 1966
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1075 place count 1965 transition count 1965
Iterating global reduction 0 with 1 rules applied. Total rules applied 1076 place count 1965 transition count 1965
Applied a total of 1076 rules in 877 ms. Remains 1965 /2503 variables (removed 538) and now considering 1965/2503 (removed 538) transitions.
// Phase 1: matrix 1965 rows 1965 cols
[2024-05-29 20:53:03] [INFO ] Computed 201 invariants in 35 ms
[2024-05-29 20:53:04] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-29 20:53:04] [INFO ] Invariant cache hit.
[2024-05-29 20:53:06] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2024-05-29 20:53:06] [INFO ] Invariant cache hit.
[2024-05-29 20:53:07] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1965/2503 places, 1965/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4568 ms. Remains : 1965/2503 places, 1965/2503 transitions.
Support contains 21 out of 1965 places after structural reductions.
[2024-05-29 20:53:07] [INFO ] Flatten gal took : 137 ms
[2024-05-29 20:53:07] [INFO ] Flatten gal took : 74 ms
[2024-05-29 20:53:07] [INFO ] Input system was already deterministic with 1965 transitions.
Support contains 19 out of 1965 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-29 20:53:08] [INFO ] Invariant cache hit.
[2024-05-29 20:53:09] [INFO ] [Real]Absence check using 201 positive place invariants in 83 ms returned sat
[2024-05-29 20:53:09] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 20:53:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 79 ms returned sat
[2024-05-29 20:53:12] [INFO ] After 1764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 20:53:13] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 6 ms to minimize.
[2024-05-29 20:53:13] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 1 ms to minimize.
[2024-05-29 20:53:13] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 1 ms to minimize.
[2024-05-29 20:53:14] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 2 ms to minimize.
[2024-05-29 20:53:14] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 2 ms to minimize.
[2024-05-29 20:53:14] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:53:15] [INFO ] Deduced a trap composed of 53 places in 272 ms of which 3 ms to minimize.
[2024-05-29 20:53:15] [INFO ] Deduced a trap composed of 54 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:53:15] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:53:16] [INFO ] Deduced a trap composed of 53 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:53:16] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 1 ms to minimize.
[2024-05-29 20:53:16] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:53:17] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:53:17] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:53:17] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:53:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5241 ms
[2024-05-29 20:53:18] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 0 ms to minimize.
[2024-05-29 20:53:18] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:53:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 674 ms
[2024-05-29 20:53:19] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:53:19] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 0 ms to minimize.
[2024-05-29 20:53:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 684 ms
[2024-05-29 20:53:19] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:53:20] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 0 ms to minimize.
[2024-05-29 20:53:20] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:53:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1018 ms
[2024-05-29 20:53:21] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:53:21] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:53:21] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2024-05-29 20:53:22] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:53:22] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2024-05-29 20:53:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1601 ms
[2024-05-29 20:53:22] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:53:23] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:53:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
[2024-05-29 20:53:23] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 0 ms to minimize.
[2024-05-29 20:53:23] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:53:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2024-05-29 20:53:24] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:53:24] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:53:24] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 4 ms to minimize.
[2024-05-29 20:53:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1009 ms
[2024-05-29 20:53:25] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:53:25] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:53:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2024-05-29 20:53:26] [INFO ] After 15348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1249 ms.
[2024-05-29 20:53:27] [INFO ] After 17617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 373 ms.
Support contains 13 out of 1965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Drop transitions removed 541 transitions
Trivial Post-agglo rules discarded 541 transitions
Performed 541 trivial Post agglomeration. Transition count delta: 541
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 1965 transition count 1424
Reduce places removed 541 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 543 rules applied. Total rules applied 1084 place count 1424 transition count 1422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1086 place count 1422 transition count 1422
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1086 place count 1422 transition count 1029
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 1872 place count 1029 transition count 1029
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1874 place count 1027 transition count 1027
Iterating global reduction 3 with 2 rules applied. Total rules applied 1876 place count 1027 transition count 1027
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1876 place count 1027 transition count 1025
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1880 place count 1025 transition count 1025
Performed 459 Post agglomeration using F-continuation condition.Transition count delta: 459
Deduced a syphon composed of 459 places in 1 ms
Reduce places removed 459 places and 0 transitions.
Iterating global reduction 3 with 918 rules applied. Total rules applied 2798 place count 566 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2799 place count 566 transition count 565
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 2801 place count 565 transition count 564
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -91
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 3003 place count 464 transition count 655
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3095 place count 418 transition count 701
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3096 place count 418 transition count 700
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3097 place count 418 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3098 place count 417 transition count 699
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3099 place count 417 transition count 698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3100 place count 416 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3101 place count 415 transition count 697
Applied a total of 3101 rules in 469 ms. Remains 415 /1965 variables (removed 1550) and now considering 697/1965 (removed 1268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 415/1965 places, 697/1965 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 185235 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185235 steps, saw 122788 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 697 rows 415 cols
[2024-05-29 20:53:31] [INFO ] Computed 200 invariants in 7 ms
[2024-05-29 20:53:32] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2024-05-29 20:53:32] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 20:53:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-29 20:53:32] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 20:53:33] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-29 20:53:33] [INFO ] After 1171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 428 ms.
Support contains 7 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 697/697 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 413 transition count 695
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 409 transition count 695
Applied a total of 12 rules in 32 ms. Remains 409 /415 variables (removed 6) and now considering 695/697 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 409/415 places, 695/697 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 140 ms. (steps per millisecond=71 ) 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 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 192940 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192940 steps, saw 122813 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 695 rows 409 cols
[2024-05-29 20:53:37] [INFO ] Computed 200 invariants in 2 ms
[2024-05-29 20:53:37] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-29 20:53:37] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:53:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2024-05-29 20:53:37] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:53:37] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-29 20:53:38] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 136 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 695/695 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 409 transition count 694
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 408 transition count 694
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 8 place count 405 transition count 696
Applied a total of 8 rules in 25 ms. Remains 405 /409 variables (removed 4) and now considering 696/695 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 405/409 places, 696/695 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 236216 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236216 steps, saw 152132 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 696 rows 405 cols
[2024-05-29 20:53:41] [INFO ] Computed 200 invariants in 4 ms
[2024-05-29 20:53:41] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-29 20:53:41] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:53:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-29 20:53:41] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:53:42] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 20:53:42] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 696/696 transitions.
Applied a total of 0 rules in 12 ms. Remains 405 /405 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 405/405 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 696/696 transitions.
Applied a total of 0 rules in 12 ms. Remains 405 /405 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2024-05-29 20:53:42] [INFO ] Invariant cache hit.
[2024-05-29 20:53:42] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 20:53:42] [INFO ] Invariant cache hit.
[2024-05-29 20:53:42] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-29 20:53:42] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-29 20:53:42] [INFO ] Invariant cache hit.
[2024-05-29 20:53:43] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 405/405 places, 696/696 transitions.
Graph (trivial) has 195 edges and 405 vertex of which 4 / 405 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 1388 edges and 403 vertex of which 401 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 192 edges and 399 vertex of which 4 / 399 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 397 transition count 687
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 191 edges and 395 vertex of which 6 / 395 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 392 transition count 678
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 189 edges and 389 vertex of which 8 / 389 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 385 transition count 667
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 185 edges and 381 vertex of which 8 / 381 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 377 transition count 653
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 181 edges and 373 vertex of which 8 / 373 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 369 transition count 639
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 177 edges and 365 vertex of which 8 / 365 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 361 transition count 625
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 173 edges and 357 vertex of which 8 / 357 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 353 transition count 611
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 169 edges and 349 vertex of which 8 / 349 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 345 transition count 597
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 165 edges and 341 vertex of which 8 / 341 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 337 transition count 583
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 161 edges and 333 vertex of which 8 / 333 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 329 transition count 569
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 157 edges and 325 vertex of which 8 / 325 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 321 transition count 555
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 153 edges and 317 vertex of which 8 / 317 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 313 transition count 541
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 149 edges and 309 vertex of which 8 / 309 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 305 transition count 527
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 145 edges and 301 vertex of which 8 / 301 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 297 transition count 513
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 141 edges and 293 vertex of which 8 / 293 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 289 transition count 499
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 137 edges and 285 vertex of which 8 / 285 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 281 transition count 485
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 133 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 8 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 273 transition count 471
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 129 edges and 269 vertex of which 8 / 269 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 265 transition count 457
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 125 edges and 261 vertex of which 6 / 261 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 17 rules applied. Total rules applied 337 place count 258 transition count 445
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 122 edges and 255 vertex of which 6 / 255 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 17 rules applied. Total rules applied 354 place count 252 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 119 edges and 248 vertex of which 6 / 248 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 20 with 17 rules applied. Total rules applied 371 place count 245 transition count 420
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 117 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 15 rules applied. Total rules applied 386 place count 238 transition count 409
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 113 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 20 rules applied. Total rules applied 406 place count 230 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 109 edges and 226 vertex of which 8 / 226 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 425 place count 222 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 105 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 444 place count 214 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 101 edges and 210 vertex of which 8 / 210 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 463 place count 206 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 97 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 482 place count 198 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 93 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 501 place count 190 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 89 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 520 place count 182 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 85 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 539 place count 174 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 81 edges and 170 vertex of which 6 / 170 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 558 place count 167 transition count 282
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 79 edges and 164 vertex of which 8 / 164 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 15 rules applied. Total rules applied 573 place count 160 transition count 271
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 75 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 20 rules applied. Total rules applied 593 place count 152 transition count 256
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 71 edges and 148 vertex of which 8 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 612 place count 144 transition count 242
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 67 edges and 140 vertex of which 8 / 140 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 631 place count 136 transition count 228
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 63 edges and 132 vertex of which 8 / 132 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 650 place count 128 transition count 214
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 59 edges and 124 vertex of which 8 / 124 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 669 place count 120 transition count 200
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 55 edges and 116 vertex of which 8 / 116 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 688 place count 112 transition count 186
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 51 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 707 place count 104 transition count 172
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 47 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 726 place count 96 transition count 158
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 43 edges and 92 vertex of which 8 / 92 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 745 place count 88 transition count 144
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 39 edges and 84 vertex of which 8 / 84 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 764 place count 80 transition count 130
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 77 vertex of which 6 / 77 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 781 place count 74 transition count 117
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 71 vertex of which 6 / 71 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 797 place count 68 transition count 105
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 29 edges and 65 vertex of which 6 / 65 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 812 place count 62 transition count 94
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 27 edges and 59 vertex of which 8 / 59 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 827 place count 55 transition count 83
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 23 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 20 rules applied. Total rules applied 847 place count 47 transition count 68
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 19 edges and 43 vertex of which 8 / 43 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 866 place count 39 transition count 54
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 15 edges and 35 vertex of which 4 / 35 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 885 place count 33 transition count 40
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 12 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 49 with 8 rules applied. Total rules applied 893 place count 30 transition count 35
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 50 with 4 rules applied. Total rules applied 897 place count 29 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 51 with 4 Pre rules applied. Total rules applied 897 place count 29 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 51 with 11 rules applied. Total rules applied 908 place count 22 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 51 with 1 rules applied. Total rules applied 909 place count 22 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 52 with 1 Pre rules applied. Total rules applied 909 place count 22 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 52 with 2 rules applied. Total rules applied 911 place count 21 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 52 with 6 rules applied. Total rules applied 917 place count 17 transition count 24
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 29 edges and 17 vertex of which 15 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 52 with 6 rules applied. Total rules applied 923 place count 15 transition count 18
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 53 with 1 rules applied. Total rules applied 924 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 54 with 1 rules applied. Total rules applied 925 place count 15 transition count 16
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 54 with 2 rules applied. Total rules applied 927 place count 15 transition count 16
Applied a total of 927 rules in 155 ms. Remains 15 /405 variables (removed 390) and now considering 16/696 (removed 680) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 15 cols
[2024-05-29 20:53:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-29 20:53:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-29 20:53:43] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-29 20:53:43] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 20:53:43] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2024-05-29 20:53:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-29 20:53:43] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:53:43] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 20:53:43] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 600 stabilizing places and 600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1964 transition count 1420
Reduce places removed 544 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 545 rules applied. Total rules applied 1089 place count 1420 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1090 place count 1419 transition count 1419
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1090 place count 1419 transition count 1026
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 1876 place count 1026 transition count 1026
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1887 place count 1015 transition count 1015
Iterating global reduction 3 with 11 rules applied. Total rules applied 1898 place count 1015 transition count 1015
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1898 place count 1015 transition count 1004
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1920 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 3 with 898 rules applied. Total rules applied 2818 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2819 place count 555 transition count 554
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 2821 place count 554 transition count 553
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 3023 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3117 place count 406 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3119 place count 404 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3120 place count 403 transition count 697
Applied a total of 3120 rules in 239 ms. Remains 403 /1965 variables (removed 1562) and now considering 697/1965 (removed 1268) transitions.
// Phase 1: matrix 697 rows 403 cols
[2024-05-29 20:53:44] [INFO ] Computed 200 invariants in 2 ms
[2024-05-29 20:53:44] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-29 20:53:44] [INFO ] Invariant cache hit.
[2024-05-29 20:53:44] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-29 20:53:44] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:53:44] [INFO ] Invariant cache hit.
[2024-05-29 20:53:45] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1965 places, 697/1965 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1371 ms. Remains : 403/1965 places, 697/1965 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 151 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-00 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 s162 1) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-00 finished in 1581 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((G(p0)||F((G(F(p1))||(p0&&F(p1)))))))))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1952 transition count 1952
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1952 transition count 1952
Applied a total of 26 rules in 217 ms. Remains 1952 /1965 variables (removed 13) and now considering 1952/1965 (removed 13) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:53:45] [INFO ] Computed 201 invariants in 13 ms
[2024-05-29 20:53:46] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-29 20:53:46] [INFO ] Invariant cache hit.
[2024-05-29 20:53:47] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2362 ms to find 0 implicit places.
[2024-05-29 20:53:47] [INFO ] Invariant cache hit.
[2024-05-29 20:53:49] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1965 places, 1952/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3666 ms. Remains : 1952/1965 places, 1952/1965 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s620 1), p1:(NEQ s850 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1595 ms.
Product exploration explored 100000 steps with 50000 reset in 1449 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-05 finished in 7075 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)||F(p1)))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1964 transition count 1420
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1088 place count 1420 transition count 1420
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1088 place count 1420 transition count 1026
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1876 place count 1026 transition count 1026
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1886 place count 1016 transition count 1016
Iterating global reduction 2 with 10 rules applied. Total rules applied 1896 place count 1016 transition count 1016
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1896 place count 1016 transition count 1006
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1916 place count 1006 transition count 1006
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2816 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2817 place count 556 transition count 555
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 2819 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3021 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3117 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3119 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3120 place count 403 transition count 699
Applied a total of 3120 rules in 298 ms. Remains 403 /1965 variables (removed 1562) and now considering 699/1965 (removed 1266) transitions.
// Phase 1: matrix 699 rows 403 cols
[2024-05-29 20:53:52] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:53:53] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-29 20:53:53] [INFO ] Invariant cache hit.
[2024-05-29 20:53:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:53:53] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-29 20:53:53] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:53:53] [INFO ] Invariant cache hit.
[2024-05-29 20:53:53] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1965 places, 699/1965 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 403/1965 places, 699/1965 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s141 1) (EQ s150 0)), p0:(EQ s150 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14851 reset in 573 ms.
Product exploration explored 100000 steps with 14709 reset in 683 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:53:55] [INFO ] Invariant cache hit.
[2024-05-29 20:53:55] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:53:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 21 ms returned sat
[2024-05-29 20:53:55] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:53:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:53:55] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:53:56] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 20:53:56] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1799 steps, including 118 resets, run visited all 1 properties in 13 ms. (steps per millisecond=138 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 17 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-05-29 20:53:56] [INFO ] Invariant cache hit.
[2024-05-29 20:53:56] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-29 20:53:56] [INFO ] Invariant cache hit.
[2024-05-29 20:53:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:53:57] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2024-05-29 20:53:57] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:53:57] [INFO ] Invariant cache hit.
[2024-05-29 20:53:57] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1192 ms. Remains : 403/403 places, 699/699 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:53:58] [INFO ] Invariant cache hit.
[2024-05-29 20:53:58] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:53:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-29 20:53:58] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:53:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:53:58] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:53:58] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 20:53:58] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 2 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 402 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 401 transition count 696
Applied a total of 4 rules in 38 ms. Remains 401 /403 variables (removed 2) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 401/403 places, 696/699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 100422 steps, run visited all 1 properties in 905 ms. (steps per millisecond=110 )
Probabilistic random walk after 100422 steps, saw 59461 distinct states, run finished after 905 ms. (steps per millisecond=110 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 313 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14738 reset in 529 ms.
Product exploration explored 100000 steps with 14555 reset in 651 ms.
Built C files in :
/tmp/ltsmin122508513610863005
[2024-05-29 20:54:01] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2024-05-29 20:54:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:01] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2024-05-29 20:54:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:01] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2024-05-29 20:54:01] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:01] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin122508513610863005
Running compilation step : cd /tmp/ltsmin122508513610863005;'/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 1868 ms.
Running link step : cd /tmp/ltsmin122508513610863005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin122508513610863005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11988666920310921702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 15 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-05-29 20:54:16] [INFO ] Invariant cache hit.
[2024-05-29 20:54:16] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 20:54:16] [INFO ] Invariant cache hit.
[2024-05-29 20:54:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:54:17] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-29 20:54:17] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:54:17] [INFO ] Invariant cache hit.
[2024-05-29 20:54:17] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1113 ms. Remains : 403/403 places, 699/699 transitions.
Built C files in :
/tmp/ltsmin5537271727761496027
[2024-05-29 20:54:17] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2024-05-29 20:54:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:17] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2024-05-29 20:54:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:17] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2024-05-29 20:54:17] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:17] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5537271727761496027
Running compilation step : cd /tmp/ltsmin5537271727761496027;'/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 1678 ms.
Running link step : cd /tmp/ltsmin5537271727761496027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5537271727761496027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6544364362276917271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:54:32] [INFO ] Flatten gal took : 39 ms
[2024-05-29 20:54:32] [INFO ] Flatten gal took : 33 ms
[2024-05-29 20:54:32] [INFO ] Time to serialize gal into /tmp/LTL7846781717655147029.gal : 10 ms
[2024-05-29 20:54:32] [INFO ] Time to serialize properties into /tmp/LTL789792832666585483.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/LTL7846781717655147029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut304606391796728178.hoa' '-atoms' '/tmp/LTL789792832666585483.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...315
Loading property file /tmp/LTL789792832666585483.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut304606391796728178.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t0.t159, t0.t160, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:54:47] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:54:48] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:54:48] [INFO ] Time to serialize gal into /tmp/LTL17196286189480670315.gal : 5 ms
[2024-05-29 20:54:48] [INFO ] Time to serialize properties into /tmp/LTL17086612382203729307.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/LTL17196286189480670315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17086612382203729307.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("(p947==0)"))||(F("((p900==1)&&(p947==0))"))))
Formula 0 simplified : F!"(p947==0)" & G!"((p900==1)&&(p947==0))"
Reverse transition relation is NOT exact ! Due to transitions t1, t0.t159, t0.t160, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:55:03] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:55:03] [INFO ] Applying decomposition
[2024-05-29 20:55:03] [INFO ] Flatten gal took : 27 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/graph11054806090159724630.txt' '-o' '/tmp/graph11054806090159724630.bin' '-w' '/tmp/graph11054806090159724630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11054806090159724630.bin' '-l' '-1' '-v' '-w' '/tmp/graph11054806090159724630.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:55:03] [INFO ] Decomposing Gal with order
[2024-05-29 20:55:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:55:03] [INFO ] Removed a total of 1376 redundant transitions.
[2024-05-29 20:55:03] [INFO ] Flatten gal took : 85 ms
[2024-05-29 20:55:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 21 ms.
[2024-05-29 20:55:03] [INFO ] Time to serialize gal into /tmp/LTL5507288130744524636.gal : 7 ms
[2024-05-29 20:55:03] [INFO ] Time to serialize properties into /tmp/LTL4733774454627882978.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/LTL5507288130744524636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4733774454627882978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(i5.u73.p947==0)"))||(F("((i4.i1.i1.u69.p900==1)&&(i5.u73.p947==0))"))))
Formula 0 simplified : F!"(i5.u73.p947==0)" & G!"((i4.i1.i1.u69.p900==1)&&(i5.u73.p947==0))"
Reverse transition relation is NOT exact ! Due to transitions i4.i1.i1.u69.t1, i5.u73.t0.t159, i5.u73.t0.t160, Intersection with reachable at each step en...210
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1741966588459133359
[2024-05-29 20:55:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1741966588459133359
Running compilation step : cd /tmp/ltsmin1741966588459133359;'/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 1260 ms.
Running link step : cd /tmp/ltsmin1741966588459133359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1741966588459133359;'/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' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-050B-LTLFireability-06 finished in 101200 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((G(p0)||(p1&&X(G(p2))))))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1952 transition count 1952
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1952 transition count 1952
Applied a total of 26 rules in 194 ms. Remains 1952 /1965 variables (removed 13) and now considering 1952/1965 (removed 13) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:55:33] [INFO ] Computed 201 invariants in 13 ms
[2024-05-29 20:55:34] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-29 20:55:34] [INFO ] Invariant cache hit.
[2024-05-29 20:55:35] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2024-05-29 20:55:35] [INFO ] Invariant cache hit.
[2024-05-29 20:55:37] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1965 places, 1952/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3461 ms. Remains : 1952/1965 places, 1952/1965 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s958 0), p0:(EQ s958 1), p2:(EQ s818 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 474 ms.
Product exploration explored 100000 steps with 0 reset in 601 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1952 stabilizing places and 598/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 812 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 20:55:39] [INFO ] Invariant cache hit.
[2024-05-29 20:55:39] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-29 20:55:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 85 ms returned sat
[2024-05-29 20:55:41] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-29 20:55:41] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 2 ms to minimize.
[2024-05-29 20:55:42] [INFO ] Deduced a trap composed of 30 places in 377 ms of which 1 ms to minimize.
[2024-05-29 20:55:42] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2024-05-29 20:55:43] [INFO ] Deduced a trap composed of 37 places in 348 ms of which 1 ms to minimize.
[2024-05-29 20:55:43] [INFO ] Deduced a trap composed of 35 places in 341 ms of which 1 ms to minimize.
[2024-05-29 20:55:43] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 0 ms to minimize.
[2024-05-29 20:55:44] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 1 ms to minimize.
[2024-05-29 20:55:44] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 3 ms to minimize.
[2024-05-29 20:55:45] [INFO ] Deduced a trap composed of 51 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:55:45] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 1 ms to minimize.
[2024-05-29 20:55:45] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 4 ms to minimize.
[2024-05-29 20:55:46] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2024-05-29 20:55:46] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:55:46] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:55:47] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 0 ms to minimize.
[2024-05-29 20:55:47] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:55:47] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 4 ms to minimize.
[2024-05-29 20:55:48] [INFO ] Deduced a trap composed of 50 places in 282 ms of which 2 ms to minimize.
[2024-05-29 20:55:48] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 0 ms to minimize.
[2024-05-29 20:55:49] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:55:49] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:55:49] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:55:50] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:55:50] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 0 ms to minimize.
[2024-05-29 20:55:50] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:55:51] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:55:51] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:55:51] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:55:52] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 1 ms to minimize.
[2024-05-29 20:55:52] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:55:52] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 77 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:55:53] [INFO ] Deduced a trap composed of 61 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:55:54] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 12895 ms
[2024-05-29 20:55:54] [INFO ] After 14170ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-29 20:55:54] [INFO ] After 14830ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1004
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 1 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
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 2797 place count 554 transition count 553
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 2999 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 698
Applied a total of 3098 rules in 194 ms. Remains 403 /1952 variables (removed 1549) and now considering 698/1952 (removed 1254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 403/1952 places, 698/1952 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 290895 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290895 steps, saw 188822 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 698 rows 403 cols
[2024-05-29 20:55:58] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:55:58] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:55:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-29 20:55:58] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:55:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:55:58] [INFO ] After 80ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:55:58] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 20:55:58] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 19 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 403/403 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2024-05-29 20:55:59] [INFO ] Invariant cache hit.
[2024-05-29 20:55:59] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 20:55:59] [INFO ] Invariant cache hit.
[2024-05-29 20:55:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:55:59] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-29 20:55:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:55:59] [INFO ] Invariant cache hit.
[2024-05-29 20:56:00] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 403/403 places, 698/698 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1387 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 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 395 transition count 689
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 196 edges and 393 vertex of which 6 / 393 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 390 transition count 680
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 194 edges and 387 vertex of which 8 / 387 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 383 transition count 669
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 190 edges and 379 vertex of which 8 / 379 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 375 transition count 655
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 186 edges and 371 vertex of which 8 / 371 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 367 transition count 641
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 182 edges and 363 vertex of which 8 / 363 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 359 transition count 627
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 178 edges and 355 vertex of which 8 / 355 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 351 transition count 613
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 174 edges and 347 vertex of which 8 / 347 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 343 transition count 599
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 170 edges and 339 vertex of which 8 / 339 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 335 transition count 585
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 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 571
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 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 557
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 158 edges and 315 vertex of which 8 / 315 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 311 transition count 543
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 154 edges and 307 vertex of which 8 / 307 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 303 transition count 529
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 150 edges and 299 vertex of which 8 / 299 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 295 transition count 515
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 146 edges and 291 vertex of which 8 / 291 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 287 transition count 501
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 283 vertex of which 8 / 283 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 279 transition count 487
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 275 vertex of which 8 / 275 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 271 transition count 473
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 267 vertex of which 8 / 267 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 263 transition count 459
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 259 vertex of which 8 / 259 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 255 transition count 445
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 251 vertex of which 8 / 251 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 247 transition count 431
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 243 vertex of which 8 / 243 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 239 transition count 417
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 235 vertex of which 8 / 235 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 231 transition count 403
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 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 389
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 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 375
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 211 vertex of which 8 / 211 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 361
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 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 95 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 13 rules applied. Total rules applied 485 place count 196 transition count 337
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 27 with 4 rules applied. Total rules applied 489 place count 195 transition count 334
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 28 with 2 rules applied. Total rules applied 491 place count 194 transition count 333
Graph (complete) has 661 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 492 place count 192 transition count 332
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 496 place count 192 transition count 328
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 30 with 4 rules applied. Total rules applied 500 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 502 place count 190 transition count 324
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 31 with 3 rules applied. Total rules applied 505 place count 188 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 509 place count 188 transition count 319
Applied a total of 509 rules in 91 ms. Remains 188 /403 variables (removed 215) and now considering 319/698 (removed 379) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 319 rows 188 cols
[2024-05-29 20:56:00] [INFO ] Computed 93 invariants in 1 ms
[2024-05-29 20:56:00] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:56:00] [INFO ] [Nat]Absence check using 93 positive place invariants in 11 ms returned sat
[2024-05-29 20:56:00] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:56:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 20:56:00] [INFO ] After 28ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:56:00] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 20:56:00] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 2248 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) p1), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) p1), true, p1, (NOT p2)]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1951 transition count 1404
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1404 transition count 1404
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1404 transition count 1003
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1003 transition count 1003
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2790 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2791 place count 556 transition count 555
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 2793 place count 555 transition count 554
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 2995 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3091 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3093 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3094 place count 403 transition count 699
Applied a total of 3094 rules in 227 ms. Remains 403 /1952 variables (removed 1549) and now considering 699/1952 (removed 1253) transitions.
// Phase 1: matrix 699 rows 403 cols
[2024-05-29 20:56:03] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:56:03] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-29 20:56:03] [INFO ] Invariant cache hit.
[2024-05-29 20:56:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:56:04] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2024-05-29 20:56:04] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:56:04] [INFO ] Invariant cache hit.
[2024-05-29 20:56:04] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1952 places, 699/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1411 ms. Remains : 403/1952 places, 699/1952 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/403 stabilizing places and 2/699 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X p1), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND p1 (NOT p2)), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:56:05] [INFO ] Invariant cache hit.
[2024-05-29 20:56:05] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:56:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-29 20:56:05] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:56:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:56:05] [INFO ] After 46ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:56:05] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-29 20:56:05] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 403 transition count 698
Applied a total of 1 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 698/699 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 403/403 places, 698/699 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3758 steps, run visited all 2 properties in 112 ms. (steps per millisecond=33 )
Probabilistic random walk after 3758 steps, saw 2215 distinct states, run finished after 112 ms. (steps per millisecond=33 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X p1), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 32829 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 1965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1964 transition count 1418
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1418 transition count 1418
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1092 place count 1418 transition count 1025
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1878 place count 1025 transition count 1025
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1889 place count 1014 transition count 1014
Iterating global reduction 2 with 11 rules applied. Total rules applied 1900 place count 1014 transition count 1014
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1900 place count 1014 transition count 1003
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1922 place count 1003 transition count 1003
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2820 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2821 place count 554 transition count 553
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 2823 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3025 place count 452 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3121 place count 404 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 402 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3124 place count 401 transition count 698
Applied a total of 3124 rules in 223 ms. Remains 401 /1965 variables (removed 1564) and now considering 698/1965 (removed 1267) transitions.
// Phase 1: matrix 698 rows 401 cols
[2024-05-29 20:56:06] [INFO ] Computed 200 invariants in 4 ms
[2024-05-29 20:56:06] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 20:56:06] [INFO ] Invariant cache hit.
[2024-05-29 20:56:07] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2024-05-29 20:56:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:56:07] [INFO ] Invariant cache hit.
[2024-05-29 20:56:07] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/1965 places, 698/1965 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1219 ms. Remains : 401/1965 places, 698/1965 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-09 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 s318 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 965 steps with 1 reset in 8 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-09 finished in 1308 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) U X(G(p1))))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1952 transition count 1952
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1952 transition count 1952
Applied a total of 26 rules in 199 ms. Remains 1952 /1965 variables (removed 13) and now considering 1952/1965 (removed 13) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:56:07] [INFO ] Computed 201 invariants in 18 ms
[2024-05-29 20:56:08] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 20:56:08] [INFO ] Invariant cache hit.
[2024-05-29 20:56:10] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2024-05-29 20:56:10] [INFO ] Invariant cache hit.
[2024-05-29 20:56:11] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1965 places, 1952/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3383 ms. Remains : 1952/1965 places, 1952/1965 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1638 1), p1:(EQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28 reset in 410 ms.
Stack based approach found an accepted trace after 3158 steps with 1 reset with depth 1030 and stack size 1030 in 17 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-10 finished in 3945 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||(p1&&X(p0))))&&F(p2))||X(G((p0||(p1&&X(p0)))))))'
Support contains 3 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1954 transition count 1954
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1954 transition count 1954
Applied a total of 22 rules in 200 ms. Remains 1954 /1965 variables (removed 11) and now considering 1954/1965 (removed 11) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2024-05-29 20:56:11] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 20:56:12] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-29 20:56:12] [INFO ] Invariant cache hit.
[2024-05-29 20:56:14] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-29 20:56:14] [INFO ] Invariant cache hit.
[2024-05-29 20:56:15] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1954/1965 places, 1954/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3670 ms. Remains : 1954/1965 places, 1954/1965 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}]], initial=0, aps=[p2:(NEQ s1759 1), p0:(NEQ s67 1), p1:(NEQ s990 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1441 ms.
Product exploration explored 100000 steps with 50000 reset in 1451 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 22 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-11 finished in 6924 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 U X(p0))) U (p1 U p2))))'
Support contains 3 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1953 transition count 1953
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1953 transition count 1953
Applied a total of 24 rules in 193 ms. Remains 1953 /1965 variables (removed 12) and now considering 1953/1965 (removed 12) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2024-05-29 20:56:18] [INFO ] Computed 201 invariants in 14 ms
[2024-05-29 20:56:19] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-29 20:56:19] [INFO ] Invariant cache hit.
[2024-05-29 20:56:20] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2024-05-29 20:56:20] [INFO ] Invariant cache hit.
[2024-05-29 20:56:22] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1965 places, 1953/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3443 ms. Remains : 1953/1965 places, 1953/1965 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s1320 1), p1:(EQ s987 1), p0:(EQ s1680 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-13 finished in 3774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 1965/1965 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1953 transition count 1953
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1953 transition count 1953
Applied a total of 24 rules in 194 ms. Remains 1953 /1965 variables (removed 12) and now considering 1953/1965 (removed 12) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2024-05-29 20:56:22] [INFO ] Computed 201 invariants in 14 ms
[2024-05-29 20:56:23] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 20:56:23] [INFO ] Invariant cache hit.
[2024-05-29 20:56:24] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2024-05-29 20:56:24] [INFO ] Invariant cache hit.
[2024-05-29 20:56:25] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1965 places, 1953/1965 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3413 ms. Remains : 1953/1965 places, 1953/1965 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1123 1), p1:(EQ s350 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 2 reset in 583 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 154816 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154816 steps, saw 90320 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 20:56:30] [INFO ] Invariant cache hit.
[2024-05-29 20:56:30] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2024-05-29 20:56:32] [INFO ] After 1041ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-29 20:56:32] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 1 ms to minimize.
[2024-05-29 20:56:33] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 1 ms to minimize.
[2024-05-29 20:56:33] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 1 ms to minimize.
[2024-05-29 20:56:33] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 1 ms to minimize.
[2024-05-29 20:56:34] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2024-05-29 20:56:34] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2024-05-29 20:56:35] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 1 ms to minimize.
[2024-05-29 20:56:35] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 1 ms to minimize.
[2024-05-29 20:56:35] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 0 ms to minimize.
[2024-05-29 20:56:36] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 1 ms to minimize.
[2024-05-29 20:56:36] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 1 ms to minimize.
[2024-05-29 20:56:37] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 0 ms to minimize.
[2024-05-29 20:56:37] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 0 ms to minimize.
[2024-05-29 20:56:37] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 1 ms to minimize.
[2024-05-29 20:56:38] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:56:38] [INFO ] Deduced a trap composed of 53 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:56:38] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 1 ms to minimize.
[2024-05-29 20:56:39] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 1 ms to minimize.
[2024-05-29 20:56:39] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2024-05-29 20:56:40] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 1 ms to minimize.
[2024-05-29 20:56:40] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 1 ms to minimize.
[2024-05-29 20:56:40] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:56:41] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:56:41] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:56:41] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:56:42] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 0 ms to minimize.
[2024-05-29 20:56:42] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:56:42] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:56:42] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:56:43] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:56:43] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 0 ms to minimize.
[2024-05-29 20:56:43] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:56:44] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:56:44] [INFO ] Deduced a trap composed of 58 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:56:44] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12412 ms
[2024-05-29 20:56:44] [INFO ] After 13640ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:56:44] [INFO ] After 14107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:56:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2024-05-29 20:56:46] [INFO ] After 1106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:56:46] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 1 ms to minimize.
[2024-05-29 20:56:47] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 2 ms to minimize.
[2024-05-29 20:56:47] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 1 ms to minimize.
[2024-05-29 20:56:48] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 1 ms to minimize.
[2024-05-29 20:56:48] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 1 ms to minimize.
[2024-05-29 20:56:49] [INFO ] Deduced a trap composed of 25 places in 420 ms of which 1 ms to minimize.
[2024-05-29 20:56:49] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 1 ms to minimize.
[2024-05-29 20:56:50] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 2 ms to minimize.
[2024-05-29 20:56:50] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 1 ms to minimize.
[2024-05-29 20:56:51] [INFO ] Deduced a trap composed of 48 places in 381 ms of which 1 ms to minimize.
[2024-05-29 20:56:51] [INFO ] Deduced a trap composed of 69 places in 372 ms of which 1 ms to minimize.
[2024-05-29 20:56:51] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 1 ms to minimize.
[2024-05-29 20:56:52] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 1 ms to minimize.
[2024-05-29 20:56:52] [INFO ] Deduced a trap composed of 42 places in 333 ms of which 1 ms to minimize.
[2024-05-29 20:56:53] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 1 ms to minimize.
[2024-05-29 20:56:53] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 1 ms to minimize.
[2024-05-29 20:56:53] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 1 ms to minimize.
[2024-05-29 20:56:54] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 1 ms to minimize.
[2024-05-29 20:56:54] [INFO ] Deduced a trap composed of 37 places in 312 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 0 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 0 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 0 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 0 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 0 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 0 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 52 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 0 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 0 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 0 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 0 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 16380 ms
[2024-05-29 20:57:03] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 0 ms to minimize.
[2024-05-29 20:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2024-05-29 20:57:03] [INFO ] After 18168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2024-05-29 20:57:03] [INFO ] After 18923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 188 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1406
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1406 transition count 1406
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1406 transition count 1006
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 1 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
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 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3003 place count 452 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 696
Applied a total of 3102 rules in 157 ms. Remains 402 /1953 variables (removed 1551) and now considering 696/1953 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 402/1953 places, 696/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) 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 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 243273 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243273 steps, saw 151890 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 696 rows 402 cols
[2024-05-29 20:57:07] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:57:07] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-29 20:57:07] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:57:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2024-05-29 20:57:07] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:57:08] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 20:57:08] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 186 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 402/402 places, 696/696 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 289205 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289205 steps, saw 182074 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:57:11] [INFO ] Invariant cache hit.
[2024-05-29 20:57:11] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:57:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-29 20:57:11] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:57:11] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-29 20:57:11] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 99 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2024-05-29 20:57:12] [INFO ] Invariant cache hit.
[2024-05-29 20:57:12] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-29 20:57:12] [INFO ] Invariant cache hit.
[2024-05-29 20:57:12] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2024-05-29 20:57:12] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:57:12] [INFO ] Invariant cache hit.
[2024-05-29 20:57:13] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 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 196 edges and 396 vertex of which 4 / 396 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 394 transition count 687
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 195 edges and 392 vertex of which 6 / 392 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 389 transition count 678
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 193 edges and 386 vertex of which 8 / 386 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 382 transition count 667
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 189 edges and 378 vertex of which 8 / 378 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 374 transition count 653
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 185 edges and 370 vertex of which 8 / 370 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 366 transition count 639
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 181 edges and 362 vertex of which 8 / 362 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 358 transition count 625
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 177 edges and 354 vertex of which 8 / 354 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 350 transition count 611
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 173 edges and 346 vertex of which 8 / 346 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 342 transition count 597
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 169 edges and 338 vertex of which 8 / 338 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 334 transition count 583
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 165 edges and 330 vertex of which 8 / 330 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 326 transition count 569
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 161 edges and 322 vertex of which 8 / 322 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 318 transition count 555
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 157 edges and 314 vertex of which 8 / 314 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 310 transition count 541
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 153 edges and 306 vertex of which 8 / 306 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 302 transition count 527
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 149 edges and 298 vertex of which 8 / 298 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 294 transition count 513
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 145 edges and 290 vertex of which 8 / 290 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 286 transition count 499
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 141 edges and 282 vertex of which 8 / 282 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 278 transition count 485
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 137 edges and 274 vertex of which 8 / 274 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 270 transition count 471
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 133 edges and 266 vertex of which 8 / 266 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 262 transition count 457
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 129 edges and 258 vertex of which 8 / 258 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 254 transition count 443
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 125 edges and 250 vertex of which 8 / 250 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 246 transition count 429
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 121 edges and 242 vertex of which 8 / 242 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 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
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 112 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 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
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 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
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 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
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 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
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 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
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 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
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 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
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 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
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 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
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 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
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 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
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 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
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 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
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 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
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 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
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 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
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 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 42 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-29 20:57:13] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 20:57:13] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:57:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 20:57:13] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:57:13] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 20:57:13] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1005
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1005 transition count 1005
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
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 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
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 2999 place count 453 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3097 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3098 place count 402 transition count 697
Applied a total of 3098 rules in 177 ms. Remains 402 /1953 variables (removed 1551) and now considering 697/1953 (removed 1256) transitions.
// Phase 1: matrix 697 rows 402 cols
[2024-05-29 20:57:13] [INFO ] Computed 200 invariants in 2 ms
[2024-05-29 20:57:14] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-29 20:57:14] [INFO ] Invariant cache hit.
[2024-05-29 20:57:14] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-29 20:57:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:57:14] [INFO ] Invariant cache hit.
[2024-05-29 20:57:14] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1953 places, 697/1953 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1175 ms. Remains : 402/1953 places, 697/1953 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 324126 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 324126 steps, saw 213638 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-29 20:57:18] [INFO ] Invariant cache hit.
[2024-05-29 20:57:18] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2024-05-29 20:57:18] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:18] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-29 20:57:18] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 697/697 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 696
Applied a total of 1 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 696/697 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 402/402 places, 696/697 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 360561 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 360561 steps, saw 221511 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 696 rows 402 cols
[2024-05-29 20:57:22] [INFO ] Computed 200 invariants in 6 ms
[2024-05-29 20:57:22] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2024-05-29 20:57:22] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:22] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 20:57:22] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2024-05-29 20:57:22] [INFO ] Invariant cache hit.
[2024-05-29 20:57:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-29 20:57:22] [INFO ] Invariant cache hit.
[2024-05-29 20:57:23] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-29 20:57:23] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:57:23] [INFO ] Invariant cache hit.
[2024-05-29 20:57:23] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1043 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 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 196 edges and 396 vertex of which 4 / 396 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 394 transition count 687
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 195 edges and 392 vertex of which 6 / 392 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 389 transition count 678
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 193 edges and 386 vertex of which 8 / 386 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 382 transition count 667
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 189 edges and 378 vertex of which 8 / 378 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 374 transition count 653
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 185 edges and 370 vertex of which 8 / 370 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 366 transition count 639
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 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 625
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 177 edges and 354 vertex of which 8 / 354 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 350 transition count 611
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 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 597
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 169 edges and 338 vertex of which 8 / 338 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 334 transition count 583
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 165 edges and 330 vertex of which 8 / 330 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 326 transition count 569
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 161 edges and 322 vertex of which 8 / 322 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 318 transition count 555
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 157 edges and 314 vertex of which 8 / 314 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 310 transition count 541
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 153 edges and 306 vertex of which 8 / 306 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 302 transition count 527
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 149 edges and 298 vertex of which 8 / 298 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 294 transition count 513
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 145 edges and 290 vertex of which 8 / 290 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 286 transition count 499
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 141 edges and 282 vertex of which 8 / 282 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 278 transition count 485
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 137 edges and 274 vertex of which 8 / 274 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 270 transition count 471
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 133 edges and 266 vertex of which 8 / 266 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 262 transition count 457
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 129 edges and 258 vertex of which 8 / 258 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 254 transition count 443
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 125 edges and 250 vertex of which 8 / 250 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 246 transition count 429
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 121 edges and 242 vertex of which 8 / 242 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 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
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 112 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 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
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 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
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 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
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 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
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 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
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 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
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 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
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 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
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 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
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 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
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 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
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 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
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 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
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 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
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 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
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 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
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 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 62 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-29 20:57:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 20:57:23] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 20:57:23] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:23] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 20:57:23] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 29 reset in 477 ms.
Product exploration explored 100000 steps with 19 reset in 577 ms.
Built C files in :
/tmp/ltsmin18400267339237733846
[2024-05-29 20:57:25] [INFO ] Computing symmetric may disable matrix : 697 transitions.
[2024-05-29 20:57:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:25] [INFO ] Computing symmetric may enable matrix : 697 transitions.
[2024-05-29 20:57:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:25] [INFO ] Computing Do-Not-Accords matrix : 697 transitions.
[2024-05-29 20:57:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:25] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18400267339237733846
Running compilation step : cd /tmp/ltsmin18400267339237733846;'/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 1743 ms.
Running link step : cd /tmp/ltsmin18400267339237733846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18400267339237733846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15175336184136656512.hoa' '--buchi-type=spotba'
LTSmin run took 8767 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 73790 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)||F(p1)))'
[2024-05-29 20:57:36] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17568441724531491845
[2024-05-29 20:57:36] [INFO ] Too many transitions (1965) to apply POR reductions. Disabling POR matrices.
[2024-05-29 20:57:36] [INFO ] Applying decomposition
[2024-05-29 20:57:36] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17568441724531491845
Running compilation step : cd /tmp/ltsmin17568441724531491845;'/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'
[2024-05-29 20:57:36] [INFO ] Flatten gal took : 38 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/graph13348019244719745313.txt' '-o' '/tmp/graph13348019244719745313.bin' '-w' '/tmp/graph13348019244719745313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13348019244719745313.bin' '-l' '-1' '-v' '-w' '/tmp/graph13348019244719745313.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:57:36] [INFO ] Decomposing Gal with order
[2024-05-29 20:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:57:37] [INFO ] Removed a total of 486 redundant transitions.
[2024-05-29 20:57:37] [INFO ] Flatten gal took : 208 ms
[2024-05-29 20:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 20:57:37] [INFO ] Time to serialize gal into /tmp/LTLFireability12671526277222561102.gal : 94 ms
[2024-05-29 20:57:37] [INFO ] Time to serialize properties into /tmp/LTLFireability825509994673444533.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/LTLFireability12671526277222561102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability825509994673444533.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
Checking formula 0 : !(((G("(i24.i1.u299.p947==0)"))||(F("((i23.i1.u284.p900==1)&&(i24.i1.u299.p947==0))"))))
Formula 0 simplified : F!"(i24.i1.u299.p947==0)" & G!"((i23.i1.u284.p900==1)&&(i24.i1.u299.p947==0))"
Compilation finished in 3782 ms.
Running link step : cd /tmp/ltsmin17568441724531491845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17568441724531491845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 21:19:09] [INFO ] Applying decomposition
[2024-05-29 21:19:09] [INFO ] Flatten gal took : 98 ms
[2024-05-29 21:19:09] [INFO ] Decomposing Gal with order
[2024-05-29 21:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:19:09] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-29 21:19:09] [INFO ] Flatten gal took : 184 ms
[2024-05-29 21:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 21:19:10] [INFO ] Time to serialize gal into /tmp/LTLFireability2281586823816477529.gal : 26 ms
[2024-05-29 21:19:10] [INFO ] Time to serialize properties into /tmp/LTLFireability8799242656420360240.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/LTLFireability2281586823816477529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8799242656420360240.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
Checking formula 0 : !(((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u180.p947==0)"))||(F("((...397
Formula 0 simplified : F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u180.p947==0)" & G!"((i0.i...389
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.060: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.092: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.092: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.544: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.545: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.576: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.576: Initializing POR dependencies: labels 1967, guards 1965
pins2lts-mc-linux64( 6/ 8), 0.686: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.308: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.315: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 1.362: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.486: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 210.806: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 3/ 8), 858.467: LTL layer: formula: ([]((LTLAPp0==true))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 3/ 8), 858.468: "([]((LTLAPp0==true))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 858.484: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 860.072: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 860.672: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 860.770: There are 1969 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 860.770: State length is 1966, there are 1968 groups
pins2lts-mc-linux64( 0/ 8), 860.770: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 860.770: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 860.770: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 860.770: Visible groups: 0 / 1968, labels: 2 / 1969
pins2lts-mc-linux64( 0/ 8), 860.770: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 860.770: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 861.163: [Blue] ~120 levels ~960 states ~7848 transitions
pins2lts-mc-linux64( 0/ 8), 861.419: [Blue] ~240 levels ~1920 states ~13528 transitions
pins2lts-mc-linux64( 0/ 8), 861.974: [Blue] ~480 levels ~3840 states ~25648 transitions
pins2lts-mc-linux64( 0/ 8), 862.971: [Blue] ~960 levels ~7680 states ~51432 transitions
pins2lts-mc-linux64( 0/ 8), 864.799: [Blue] ~1920 levels ~15360 states ~102360 transitions
pins2lts-mc-linux64( 0/ 8), 869.027: [Blue] ~3840 levels ~30720 states ~258136 transitions
pins2lts-mc-linux64( 5/ 8), 877.442: [Blue] ~6839 levels ~61440 states ~431728 transitions
pins2lts-mc-linux64( 7/ 8), 890.245: [Blue] ~10212 levels ~122880 states ~649656 transitions
pins2lts-mc-linux64( 7/ 8), 915.949: [Blue] ~20427 levels ~245760 states ~1166112 transitions
pins2lts-mc-linux64( 7/ 8), 967.451: [Blue] ~40276 levels ~491520 states ~2205048 transitions
pins2lts-mc-linux64( 7/ 8), 1073.414: [Blue] ~81052 levels ~983040 states ~4395184 transitions
pins2lts-mc-linux64( 6/ 8), 1268.655: [Blue] ~135221 levels ~1966080 states ~9820728 transitions
pins2lts-mc-linux64( 6/ 8), 1658.470: [Blue] ~292799 levels ~3932160 states ~18385008 transitions
pins2lts-mc-linux64( 1/ 8), 1979.249: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1979.344:
pins2lts-mc-linux64( 0/ 8), 1979.344: Explored 4738772 states 28685602 transitions, fanout: 6.053
pins2lts-mc-linux64( 0/ 8), 1979.344: Total exploration time 1118.560 sec (1118.460 sec minimum, 1118.503 sec on average)
pins2lts-mc-linux64( 0/ 8), 1979.344: States per second: 4236, Transitions per second: 25645
pins2lts-mc-linux64( 0/ 8), 1979.344:
pins2lts-mc-linux64( 0/ 8), 1979.344: State space has 19145332 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1979.344: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1979.344: blue states: 4738772 (24.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1979.344: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1979.344: all-red states: 1020594 (5.33%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1979.344:
pins2lts-mc-linux64( 0/ 8), 1979.344: Total memory used for local state coloring: 53.8MB
pins2lts-mc-linux64( 0/ 8), 1979.344:
pins2lts-mc-linux64( 0/ 8), 1979.344: Queue width: 8B, total height: 3527678, memory: 26.91MB
pins2lts-mc-linux64( 0/ 8), 1979.344: Tree memory: 402.1MB, 22.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1979.344: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1979.344: Stored 2008 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1979.344: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1979.344: Est. total memory use: 429.0MB (~1050.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17568441724531491845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17568441724531491845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t1863, i0.t1766, i0.i0.t1861, i0.i0.i0.t1768, i0.i0.i0.i0.t1859, i0.i0.i0.i0.i0.t1770, i0.i0....42097
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 21:40:41] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:40:41] [INFO ] Input system was already deterministic with 1965 transitions.
[2024-05-29 21:40:41] [INFO ] Transformed 1965 places.
[2024-05-29 21:40:41] [INFO ] Transformed 1965 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 21:40:41] [INFO ] Time to serialize gal into /tmp/LTLFireability17891716190971133164.gal : 6 ms
[2024-05-29 21:40:41] [INFO ] Time to serialize properties into /tmp/LTLFireability13647698187456423662.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/LTLFireability17891716190971133164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13647698187456423662.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(p947==0)"))||(F("((p900==1)&&(p947==0))"))))
Formula 0 simplified : F!"(p947==0)" & G!"((p900==1)&&(p947==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 152472 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16238380 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-050B"
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-050B, 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-171683789800648"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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