Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025500636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 376K May 10 09:34 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 ShieldPPPt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653024254659

Running Version 202205111006
[2022-05-20 05:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 05:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 05:24:16] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-05-20 05:24:16] [INFO ] Transformed 1563 places.
[2022-05-20 05:24:16] [INFO ] Transformed 1423 transitions.
[2022-05-20 05:24:16] [INFO ] Found NUPN structural information;
[2022-05-20 05:24:16] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 1350 transition count 1210
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 1350 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1349 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1349 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 429 place count 1348 transition count 1208
Iterating global reduction 0 with 1 rules applied. Total rules applied 430 place count 1348 transition count 1208
Applied a total of 430 rules in 532 ms. Remains 1348 /1563 variables (removed 215) and now considering 1208/1423 (removed 215) transitions.
// Phase 1: matrix 1208 rows 1348 cols
[2022-05-20 05:24:16] [INFO ] Computed 221 place invariants in 32 ms
[2022-05-20 05:24:17] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 1208 rows 1348 cols
[2022-05-20 05:24:17] [INFO ] Computed 221 place invariants in 12 ms
[2022-05-20 05:24:18] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
// Phase 1: matrix 1208 rows 1348 cols
[2022-05-20 05:24:18] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:24:19] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1348/1563 places, 1208/1423 transitions.
Finished structural reductions, in 1 iterations. Remains : 1348/1563 places, 1208/1423 transitions.
Support contains 34 out of 1348 places after structural reductions.
[2022-05-20 05:24:19] [INFO ] Flatten gal took : 111 ms
[2022-05-20 05:24:19] [INFO ] Flatten gal took : 64 ms
[2022-05-20 05:24:19] [INFO ] Input system was already deterministic with 1208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1208 rows 1348 cols
[2022-05-20 05:24:20] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:24:21] [INFO ] [Real]Absence check using 221 positive place invariants in 70 ms returned sat
[2022-05-20 05:24:21] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 05:24:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 64 ms returned sat
[2022-05-20 05:24:22] [INFO ] After 937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 05:24:23] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 5 ms to minimize.
[2022-05-20 05:24:23] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 2 ms to minimize.
[2022-05-20 05:24:23] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2022-05-20 05:24:23] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
[2022-05-20 05:24:24] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2022-05-20 05:24:24] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2022-05-20 05:24:24] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2022-05-20 05:24:24] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-05-20 05:24:24] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-20 05:24:25] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-05-20 05:24:26] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-05-20 05:24:27] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2022-05-20 05:24:28] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2022-05-20 05:24:28] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:24:28] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5351 ms
[2022-05-20 05:24:28] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2022-05-20 05:24:29] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-05-20 05:24:29] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2022-05-20 05:24:29] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-05-20 05:24:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 602 ms
[2022-05-20 05:24:29] [INFO ] After 7673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 458 ms.
[2022-05-20 05:24:30] [INFO ] After 8825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 552 ms.
Support contains 15 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 1348 transition count 936
Reduce places removed 272 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 275 rules applied. Total rules applied 547 place count 1076 transition count 933
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 550 place count 1073 transition count 933
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 550 place count 1073 transition count 779
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 858 place count 919 transition count 779
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 862 place count 915 transition count 775
Iterating global reduction 3 with 4 rules applied. Total rules applied 866 place count 915 transition count 775
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 866 place count 915 transition count 771
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 874 place count 911 transition count 771
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1546 place count 575 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1547 place count 575 transition count 434
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1549 place count 574 transition count 433
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1661 place count 518 transition count 433
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1662 place count 518 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1663 place count 517 transition count 432
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 5 with 56 rules applied. Total rules applied 1719 place count 517 transition count 432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1720 place count 516 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1721 place count 515 transition count 431
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1721 place count 515 transition count 429
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1725 place count 513 transition count 429
Applied a total of 1725 rules in 306 ms. Remains 513 /1348 variables (removed 835) and now considering 429/1208 (removed 779) transitions.
Finished structural reductions, in 1 iterations. Remains : 513/1348 places, 429/1208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 429 rows 513 cols
[2022-05-20 05:24:31] [INFO ] Computed 220 place invariants in 4 ms
[2022-05-20 05:24:31] [INFO ] [Real]Absence check using 220 positive place invariants in 28 ms returned sat
[2022-05-20 05:24:31] [INFO ] After 188ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2022-05-20 05:24:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:24:32] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 05:24:32] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 05:24:32] [INFO ] [Nat]Absence check using 220 positive place invariants in 28 ms returned sat
[2022-05-20 05:24:32] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 05:24:32] [INFO ] After 135ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 05:24:32] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-20 05:24:32] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 513/513 places, 429/429 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 513 transition count 426
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 510 transition count 426
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 507 transition count 423
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 507 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 506 transition count 422
Applied a total of 14 rules in 72 ms. Remains 506 /513 variables (removed 7) and now considering 422/429 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 506/513 places, 422/429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 123825 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{2=1}
Probabilistic random walk after 123825 steps, saw 103184 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 422 rows 506 cols
[2022-05-20 05:24:37] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:24:37] [INFO ] [Real]Absence check using 220 positive place invariants in 30 ms returned sat
[2022-05-20 05:24:37] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 05:24:37] [INFO ] [Nat]Absence check using 220 positive place invariants in 27 ms returned sat
[2022-05-20 05:24:37] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 05:24:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:24:37] [INFO ] After 116ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:24:37] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-05-20 05:24:38] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 58 ms.
Support contains 8 out of 506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 506/506 places, 422/422 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 505 transition count 421
Applied a total of 2 rules in 16 ms. Remains 505 /506 variables (removed 1) and now considering 421/422 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/506 places, 421/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 505 cols
[2022-05-20 05:24:38] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:24:38] [INFO ] [Real]Absence check using 220 positive place invariants in 28 ms returned sat
[2022-05-20 05:24:38] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2022-05-20 05:24:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:24:38] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:38] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:39] [INFO ] [Nat]Absence check using 220 positive place invariants in 30 ms returned sat
[2022-05-20 05:24:39] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:39] [INFO ] After 84ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:39] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2022-05-20 05:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-20 05:24:39] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-20 05:24:39] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 505 /505 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/505 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 137340 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137340 steps, saw 114832 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 505 cols
[2022-05-20 05:24:43] [INFO ] Computed 220 place invariants in 4 ms
[2022-05-20 05:24:43] [INFO ] [Real]Absence check using 220 positive place invariants in 27 ms returned sat
[2022-05-20 05:24:43] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2022-05-20 05:24:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:24:43] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:43] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:43] [INFO ] [Nat]Absence check using 220 positive place invariants in 30 ms returned sat
[2022-05-20 05:24:44] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:44] [INFO ] After 85ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:44] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2022-05-20 05:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-20 05:24:44] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-20 05:24:44] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 421/421 transitions.
Applied a total of 0 rules in 24 ms. Remains 505 /505 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/505 places, 421/421 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 505 /505 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 505 cols
[2022-05-20 05:24:44] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:24:44] [INFO ] Implicit Places using invariants in 262 ms returned [488, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 503/505 places, 421/421 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 501 transition count 419
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 419
Applied a total of 4 rules in 14 ms. Remains 501 /503 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:44] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:24:45] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:45] [INFO ] Computed 218 place invariants in 4 ms
[2022-05-20 05:24:45] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 501/505 places, 419/421 transitions.
Finished structural reductions, in 2 iterations. Remains : 501/505 places, 419/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 138071 steps, run timeout after 3004 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 138071 steps, saw 115020 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:48] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:24:48] [INFO ] [Real]Absence check using 218 positive place invariants in 29 ms returned sat
[2022-05-20 05:24:49] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:49] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:24:49] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:49] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-20 05:24:49] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 501/501 places, 419/419 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 419/419 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 501/501 places, 419/419 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:49] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:24:50] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:50] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:24:50] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2022-05-20 05:24:50] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:50] [INFO ] Computed 218 place invariants in 4 ms
[2022-05-20 05:24:50] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 419/419 transitions.
Partial Free-agglomeration rule applied 111 times.
Drop transitions removed 111 transitions
Iterating global reduction 0 with 111 rules applied. Total rules applied 111 place count 501 transition count 419
Applied a total of 111 rules in 22 ms. Remains 501 /501 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:24:50] [INFO ] Computed 218 place invariants in 4 ms
[2022-05-20 05:24:50] [INFO ] [Real]Absence check using 218 positive place invariants in 29 ms returned sat
[2022-05-20 05:24:51] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:24:51] [INFO ] [Nat]Absence check using 218 positive place invariants in 26 ms returned sat
[2022-05-20 05:24:51] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:51] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-05-20 05:24:51] [INFO ] After 186ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:51] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 05:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-20 05:24:51] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-05-20 05:24:52] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:24:52] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:24:52] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:24:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12802636324951225418.gal : 11 ms
[2022-05-20 05:24:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17038056414193518332.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16744940886410277827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12802636324951225418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17038056414193518332.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17038056414193518332.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :64 after 90
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :90 after 258
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :258 after 1230
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1230 after 21751
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21751 after 68267
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :68267 after 2.0698e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.0698e+06 after 8.83522e+07
Reachability property AtomicPropp20 is true.
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.83522e+07 after 6.29364e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.29364e+09 after 2.34893e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.34893e+10 after 1.42585e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.42585e+12 after 1.18383e+13
Reachability property AtomicPropp18 is true.
Reachability property AtomicPropp17 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.18753e+20,3.26584,94100,2,17872,25,275343,6,0,2370,684939,0
Total reachable state count : 118752509941904895384

Verifying 5 reachability properties.
Reachability property AtomicPropp1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp1,46592,3.26842,94100,2,589,25,275343,7,0,2376,684939,0
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,8.11657e+09,3.26989,94100,2,1086,25,275343,8,0,2378,684939,0
Reachability property AtomicPropp17 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp17,1.46763e+17,3.27127,94100,2,2843,25,275343,9,0,2380,684939,0
Reachability property AtomicPropp18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,1.75674e+18,3.2728,94100,2,3337,25,275343,10,0,2382,684939,0
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,4.05829e+09,3.27383,94100,2,1085,25,275343,11,0,2384,684939,0
FORMULA ShieldPPPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 320 stabilizing places and 320 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(X(!p1)) U (p2 U G(p3)))))'
Support contains 5 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1342 transition count 1202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1342 transition count 1202
Applied a total of 12 rules in 74 ms. Remains 1342 /1348 variables (removed 6) and now considering 1202/1208 (removed 6) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:55] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-20 05:24:56] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:56] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:24:57] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:57] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:24:57] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1348 places, 1202/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1348 places, 1202/1208 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=3 dest: 6}, { cond=(AND p2 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 5}, { cond=(AND p3 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(NEQ s192 1), p0:(EQ s1204 1), p2:(EQ s1111 1), p1:(AND (EQ s100 1) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33259 reset in 818 ms.
Product exploration explored 100000 steps with 33227 reset in 752 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1342 stabilizing places and 318/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 p1))), (X p3), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p3 p0))), (X (AND p3 (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p3 p1)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 2284 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 275 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:25:03] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-20 05:25:03] [INFO ] [Real]Absence check using 221 positive place invariants in 60 ms returned sat
[2022-05-20 05:25:04] [INFO ] After 512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2022-05-20 05:25:04] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2022-05-20 05:25:04] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2022-05-20 05:25:04] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2022-05-20 05:25:05] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2022-05-20 05:25:05] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2022-05-20 05:25:05] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 0 ms to minimize.
[2022-05-20 05:25:05] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2022-05-20 05:25:06] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 7 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2022-05-20 05:25:07] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 0 ms to minimize.
[2022-05-20 05:25:08] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4606 ms
[2022-05-20 05:25:08] [INFO ] After 5256ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:25:08] [INFO ] After 5867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:25:09] [INFO ] [Nat]Absence check using 221 positive place invariants in 59 ms returned sat
[2022-05-20 05:25:10] [INFO ] After 935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 05:25:10] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 3 ms to minimize.
[2022-05-20 05:25:11] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 0 ms to minimize.
[2022-05-20 05:25:11] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 0 ms to minimize.
[2022-05-20 05:25:11] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2022-05-20 05:25:11] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2022-05-20 05:25:12] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2022-05-20 05:25:12] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2022-05-20 05:25:12] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2022-05-20 05:25:12] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2022-05-20 05:25:12] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2022-05-20 05:25:13] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2022-05-20 05:25:13] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2022-05-20 05:25:13] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2022-05-20 05:25:13] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-05-20 05:25:13] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2022-05-20 05:25:14] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-05-20 05:25:14] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2022-05-20 05:25:14] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2022-05-20 05:25:14] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-05-20 05:25:14] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2022-05-20 05:25:15] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2022-05-20 05:25:16] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-20 05:25:17] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2022-05-20 05:25:17] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6518 ms
[2022-05-20 05:25:17] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-20 05:25:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2022-05-20 05:25:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2022-05-20 05:25:18] [INFO ] After 8548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 504 ms.
[2022-05-20 05:25:18] [INFO ] After 9702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 498 ms.
Support contains 4 out of 1342 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 1342 transition count 928
Reduce places removed 274 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 1068 transition count 926
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 1066 transition count 926
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 161 Pre rules applied. Total rules applied 552 place count 1066 transition count 765
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 874 place count 905 transition count 765
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 875 place count 904 transition count 764
Iterating global reduction 3 with 1 rules applied. Total rules applied 876 place count 904 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 876 place count 904 transition count 763
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 878 place count 903 transition count 763
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1552 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1553 place count 566 transition count 425
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 1555 place count 565 transition count 424
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1671 place count 507 transition count 424
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 1729 place count 507 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1730 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1731 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1731 place count 505 transition count 421
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1735 place count 503 transition count 421
Applied a total of 1735 rules in 155 ms. Remains 503 /1342 variables (removed 839) and now considering 421/1202 (removed 781) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1342 places, 421/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:25:19] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:25:20] [INFO ] [Real]Absence check using 220 positive place invariants in 27 ms returned sat
[2022-05-20 05:25:20] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:25:20] [INFO ] [Nat]Absence check using 220 positive place invariants in 27 ms returned sat
[2022-05-20 05:25:20] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 05:25:20] [INFO ] After 93ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:20] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-20 05:25:20] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2022-05-20 05:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2022-05-20 05:25:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-20 05:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-20 05:25:21] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 05:25:21] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 160930 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160930 steps, saw 125712 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:25:24] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:25:24] [INFO ] [Real]Absence check using 220 positive place invariants in 28 ms returned sat
[2022-05-20 05:25:24] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:25:25] [INFO ] [Nat]Absence check using 220 positive place invariants in 29 ms returned sat
[2022-05-20 05:25:25] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 05:25:25] [INFO ] After 90ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-20 05:25:25] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-05-20 05:25:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2022-05-20 05:25:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-20 05:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-20 05:25:25] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 05:25:25] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 421/421 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:25:25] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:25:26] [INFO ] Implicit Places using invariants in 250 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 501/503 places, 421/421 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 499 transition count 419
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 499 transition count 419
Applied a total of 4 rules in 13 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:26] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:25:26] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:26] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:25:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:25:26] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 499/503 places, 419/421 transitions.
Finished structural reductions, in 2 iterations. Remains : 499/503 places, 419/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 165548 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165548 steps, saw 126428 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:30] [INFO ] Computed 218 place invariants in 3 ms
[2022-05-20 05:25:30] [INFO ] [Real]Absence check using 218 positive place invariants in 29 ms returned sat
[2022-05-20 05:25:30] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:25:30] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2022-05-20 05:25:30] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:25:31] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:31] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-20 05:25:31] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:31] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:25:31] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:31] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:25:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:25:32] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2022-05-20 05:25:32] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:32] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:25:32] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 499 transition count 419
Applied a total of 116 rules in 18 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:25:32] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:25:32] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:25:32] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 05:25:32] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2022-05-20 05:25:33] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 05:25:33] [INFO ] After 149ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:25:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-20 05:25:33] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 121 ms.
[2022-05-20 05:25:34] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 05:25:34] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:25:34] [INFO ] Flatten gal took : 23 ms
[2022-05-20 05:25:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13231655953882506888.gal : 5 ms
[2022-05-20 05:25:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16153302196473580688.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7214768526317467778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13231655953882506888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16153302196473580688.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16153302196473580688.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :48 after 82
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :82 after 116
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :116 after 284
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :284 after 1256
Reachability property apf8 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1256 after 26215
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :26215 after 88496
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :88496 after 1.98022e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.98022e+06 after 8.77769e+07
Reachability property apf14 is true.
Reachability property apf11 is true.
Reachability property apf9 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.77769e+07 after 4.54862e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.54862e+09 after 3.08851e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.08851e+10 after 1.87593e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.87593e+12 after 7.60395e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.60395e+13 after 8.31467e+18
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8.31467e+18 after 1.49171e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.49171e+23 after 1.24444e+30
Detected timeout of ITS tools.
[2022-05-20 05:25:49] [INFO ] Flatten gal took : 20 ms
[2022-05-20 05:25:49] [INFO ] Applying decomposition
[2022-05-20 05:25:49] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10548375697959806631.txt' '-o' '/tmp/graph10548375697959806631.bin' '-w' '/tmp/graph10548375697959806631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10548375697959806631.bin' '-l' '-1' '-v' '-w' '/tmp/graph10548375697959806631.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:25:49] [INFO ] Decomposing Gal with order
[2022-05-20 05:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:25:49] [INFO ] Removed a total of 95 redundant transitions.
[2022-05-20 05:25:49] [INFO ] Flatten gal took : 82 ms
[2022-05-20 05:25:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 8 ms.
[2022-05-20 05:25:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2553359389804257203.gal : 8 ms
[2022-05-20 05:25:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3734535253631053750.prop : 5 ms
Invoking ITS tools like this :cd /tmp/redAtoms7214768526317467778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2553359389804257203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3734535253631053750.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality3734535253631053750.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 768
Reachability property apf6 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.57078e+11,0.256074,11972,1093,190,14388,722,690,32822,133,5274,0
Total reachable state count : 257077805632

Verifying 1 reachability properties.
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,1.14893e+06,0.2576,12236,161,70,14388,722,713,32822,142,5274,0
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 p1))), (X p3), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p3 p0))), (X (AND p3 (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p3 p1)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p3)), (F (AND p2 p3)), (F (NOT (AND (NOT p2) p3))), (F (AND p1 p3)), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p2) (NOT p3))), (F p1), (F (AND (NOT p1) p2 p3)), (F (AND p1 (NOT p2) p3))]
Knowledge based reduction with 43 factoid took 2450 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 364 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Support contains 4 out of 1342 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 1342 /1342 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:25:53] [INFO ] Computed 221 place invariants in 15 ms
[2022-05-20 05:25:53] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:25:53] [INFO ] Computed 221 place invariants in 13 ms
[2022-05-20 05:25:54] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:25:54] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:25:55] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1342 places, 1202/1202 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1342 stabilizing places and 318/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1111 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 226 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:25:57] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:25:57] [INFO ] [Real]Absence check using 221 positive place invariants in 56 ms returned sat
[2022-05-20 05:25:58] [INFO ] After 501ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2022-05-20 05:25:58] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 11 ms to minimize.
[2022-05-20 05:25:58] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2022-05-20 05:25:58] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 0 ms to minimize.
[2022-05-20 05:25:59] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 0 ms to minimize.
[2022-05-20 05:25:59] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2022-05-20 05:25:59] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2022-05-20 05:25:59] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2022-05-20 05:26:00] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2022-05-20 05:26:00] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 0 ms to minimize.
[2022-05-20 05:26:00] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2022-05-20 05:26:00] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2022-05-20 05:26:00] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 0 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2022-05-20 05:26:01] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2022-05-20 05:26:02] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4789 ms
[2022-05-20 05:26:03] [INFO ] After 5464ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:26:03] [INFO ] After 5995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:26:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 70 ms returned sat
[2022-05-20 05:26:04] [INFO ] After 919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 05:26:04] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2022-05-20 05:26:05] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2022-05-20 05:26:05] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2022-05-20 05:26:05] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2022-05-20 05:26:06] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 0 ms to minimize.
[2022-05-20 05:26:06] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2022-05-20 05:26:06] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 0 ms to minimize.
[2022-05-20 05:26:06] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2022-05-20 05:26:07] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2022-05-20 05:26:07] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2022-05-20 05:26:07] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2022-05-20 05:26:07] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2022-05-20 05:26:07] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2022-05-20 05:26:08] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2022-05-20 05:26:08] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 1 ms to minimize.
[2022-05-20 05:26:08] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2022-05-20 05:26:08] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 0 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-20 05:26:09] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2022-05-20 05:26:10] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2022-05-20 05:26:10] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-20 05:26:10] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-05-20 05:26:10] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2022-05-20 05:26:10] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2022-05-20 05:26:11] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 7071 ms
[2022-05-20 05:26:12] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-20 05:26:12] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-20 05:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2022-05-20 05:26:12] [INFO ] After 9133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 525 ms.
[2022-05-20 05:26:13] [INFO ] After 10319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 462 ms.
Support contains 4 out of 1342 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 1342 transition count 928
Reduce places removed 274 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 1068 transition count 926
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 1066 transition count 926
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 161 Pre rules applied. Total rules applied 552 place count 1066 transition count 765
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 874 place count 905 transition count 765
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 875 place count 904 transition count 764
Iterating global reduction 3 with 1 rules applied. Total rules applied 876 place count 904 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 876 place count 904 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 878 place count 903 transition count 763
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1552 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1553 place count 566 transition count 425
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 1555 place count 565 transition count 424
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 16 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1671 place count 507 transition count 424
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 1729 place count 507 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1730 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1731 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1731 place count 505 transition count 421
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1735 place count 503 transition count 421
Applied a total of 1735 rules in 238 ms. Remains 503 /1342 variables (removed 839) and now considering 421/1202 (removed 781) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1342 places, 421/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 108086 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 108086 steps, saw 85435 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :3
Running SMT prover for 8 properties.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:26:18] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:26:18] [INFO ] [Real]Absence check using 220 positive place invariants in 25 ms returned sat
[2022-05-20 05:26:18] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:26:18] [INFO ] [Nat]Absence check using 220 positive place invariants in 25 ms returned sat
[2022-05-20 05:26:19] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 05:26:19] [INFO ] After 129ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:19] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-05-20 05:26:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-20 05:26:19] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 139 ms.
[2022-05-20 05:26:19] [INFO ] After 1040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 106106 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106106 steps, saw 83771 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:26:23] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:26:23] [INFO ] [Real]Absence check using 220 positive place invariants in 28 ms returned sat
[2022-05-20 05:26:23] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:26:24] [INFO ] [Nat]Absence check using 220 positive place invariants in 31 ms returned sat
[2022-05-20 05:26:24] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 05:26:24] [INFO ] After 145ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:24] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-05-20 05:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-20 05:26:24] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 146 ms.
[2022-05-20 05:26:24] [INFO ] After 1103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 421/421 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 421/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:26:25] [INFO ] Computed 220 place invariants in 7 ms
[2022-05-20 05:26:25] [INFO ] Implicit Places using invariants in 432 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 501/503 places, 421/421 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 499 transition count 419
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 499 transition count 419
Applied a total of 4 rules in 11 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:25] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:25] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:25] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:26:26] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 499/503 places, 419/421 transitions.
Finished structural reductions, in 2 iterations. Remains : 499/503 places, 419/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 140941 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140941 steps, saw 107320 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:29] [INFO ] Computed 218 place invariants in 3 ms
[2022-05-20 05:26:30] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:26:30] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:26:30] [INFO ] [Nat]Absence check using 218 positive place invariants in 31 ms returned sat
[2022-05-20 05:26:30] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:26:30] [INFO ] After 136ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:31] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-20 05:26:31] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2022-05-20 05:26:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-05-20 05:26:31] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2022-05-20 05:26:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-20 05:26:31] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 139 ms.
[2022-05-20 05:26:31] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:31] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:31] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:31] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:26:32] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2022-05-20 05:26:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:32] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:32] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 499 transition count 419
Applied a total of 116 rules in 18 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:26:32] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:26:32] [INFO ] [Real]Absence check using 218 positive place invariants in 47 ms returned sat
[2022-05-20 05:26:33] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:26:33] [INFO ] [Nat]Absence check using 218 positive place invariants in 26 ms returned sat
[2022-05-20 05:26:33] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 05:26:33] [INFO ] After 216ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:33] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:26:33] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-20 05:26:33] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-05-20 05:26:34] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:26:34] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-20 05:26:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 508 ms
[2022-05-20 05:26:34] [INFO ] After 969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-05-20 05:26:34] [INFO ] After 1600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:26:34] [INFO ] Flatten gal took : 20 ms
[2022-05-20 05:26:34] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:26:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8128923822947299540.gal : 12 ms
[2022-05-20 05:26:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6746576969100340682.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2258099152691764655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8128923822947299540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6746576969100340682.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6746576969100340682.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :48 after 82
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :82 after 116
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :116 after 284
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :284 after 1256
Reachability property apf12 is true.
Reachability property apf8 is true.
Reachability property apf1 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1256 after 26215
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :26215 after 88496
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :88496 after 1.98022e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.98022e+06 after 8.77769e+07
Reachability property apf14 is true.
Reachability property apf11 is true.
Reachability property apf9 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.77769e+07 after 4.54862e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.54862e+09 after 3.08851e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.08851e+10 after 1.87593e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.87593e+12 after 7.60395e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.60395e+13 after 8.31467e+18
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8.31467e+18 after 1.49171e+23
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.49171e+23 after 1.24444e+30
Detected timeout of ITS tools.
[2022-05-20 05:26:49] [INFO ] Flatten gal took : 22 ms
[2022-05-20 05:26:49] [INFO ] Applying decomposition
[2022-05-20 05:26:49] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4774640842066728335.txt' '-o' '/tmp/graph4774640842066728335.bin' '-w' '/tmp/graph4774640842066728335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4774640842066728335.bin' '-l' '-1' '-v' '-w' '/tmp/graph4774640842066728335.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:26:49] [INFO ] Decomposing Gal with order
[2022-05-20 05:26:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:26:50] [INFO ] Removed a total of 98 redundant transitions.
[2022-05-20 05:26:50] [INFO ] Flatten gal took : 64 ms
[2022-05-20 05:26:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 4 ms.
[2022-05-20 05:26:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10850359613407909802.gal : 12 ms
[2022-05-20 05:26:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1715555315107746149.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2258099152691764655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10850359613407909802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1715555315107746149.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality1715555315107746149.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2 after 240
Reachability property apf7 is true.
Reachability property apf6 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.67577e+12,0.167348,9608,905,167,9367,540,704,22121,138,3441,0
Total reachable state count : 5675769957696

Verifying 2 reachability properties.
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,1.30056e+09,0.168657,9872,237,81,9367,540,729,22121,145,3441,0
Reachability property apf7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,6.50281e+09,0.169349,9872,240,93,9367,540,738,22121,147,3441,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p3)), (F (AND p2 p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 p3))]
Knowledge based reduction with 24 factoid took 1193 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 33376 reset in 680 ms.
Product exploration explored 100000 steps with 33376 reset in 694 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 259 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Support contains 4 out of 1342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1342 transition count 1202
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 103 Pre rules applied. Total rules applied 276 place count 1342 transition count 1283
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 379 place count 1342 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 380 place count 1341 transition count 1282
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 381 place count 1341 transition count 1282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 381 place count 1341 transition count 1283
Deduced a syphon composed of 380 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 382 place count 1341 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 383 place count 1340 transition count 1281
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 384 place count 1340 transition count 1281
Performed 375 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 754 places in 1 ms
Iterating global reduction 1 with 375 rules applied. Total rules applied 759 place count 1340 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 760 place count 1340 transition count 1280
Renaming transitions due to excessive name length > 1024 char.
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 899 place count 1201 transition count 1141
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 139 rules applied. Total rules applied 1038 place count 1201 transition count 1141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1039 place count 1201 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1041 place count 1199 transition count 1139
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1043 place count 1199 transition count 1139
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -329
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1121 place count 1199 transition count 1468
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1199 place count 1121 transition count 1312
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1277 place count 1121 transition count 1312
Deduced a syphon composed of 614 places in 1 ms
Applied a total of 1277 rules in 971 ms. Remains 1121 /1342 variables (removed 221) and now considering 1312/1202 (removed -110) transitions.
[2022-05-20 05:26:55] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1312 rows 1121 cols
[2022-05-20 05:26:55] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:26:56] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1342 places, 1312/1202 transitions.
Finished structural reductions, in 1 iterations. Remains : 1121/1342 places, 1312/1202 transitions.
Product exploration explored 100000 steps with 31764 reset in 3117 ms.
Product exploration explored 100000 steps with 32036 reset in 3165 ms.
Built C files in :
/tmp/ltsmin2987540024301607934
[2022-05-20 05:27:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2987540024301607934
Running compilation step : cd /tmp/ltsmin2987540024301607934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2018 ms.
Running link step : cd /tmp/ltsmin2987540024301607934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2987540024301607934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11023497913799600011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1341 transition count 1201
Applied a total of 2 rules in 80 ms. Remains 1341 /1342 variables (removed 1) and now considering 1201/1202 (removed 1) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:27:17] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:27:17] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:27:17] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:27:18] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:27:18] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:27:19] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1342 places, 1201/1202 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1342 places, 1201/1202 transitions.
Built C files in :
/tmp/ltsmin15896866893725027397
[2022-05-20 05:27:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15896866893725027397
Running compilation step : cd /tmp/ltsmin15896866893725027397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1925 ms.
Running link step : cd /tmp/ltsmin15896866893725027397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15896866893725027397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3857630274106918816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 05:27:34] [INFO ] Flatten gal took : 30 ms
[2022-05-20 05:27:34] [INFO ] Flatten gal took : 30 ms
[2022-05-20 05:27:34] [INFO ] Time to serialize gal into /tmp/LTL14207666879220574055.gal : 4 ms
[2022-05-20 05:27:34] [INFO ] Time to serialize properties into /tmp/LTL16614948888197768950.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14207666879220574055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16614948888197768950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1420766...268
Read 1 LTL properties
Checking formula 0 : !((("(p1399==1)")U((G(X(!("((p111==1)&&(p147==1))"))))U(("(p1287==1)")U(G("(p215!=1)"))))))
Formula 0 simplified : !("(p1399==1)" U (GX!"((p111==1)&&(p147==1))" U ("(p1287==1)" U G"(p215!=1)")))
Detected timeout of ITS tools.
[2022-05-20 05:27:49] [INFO ] Flatten gal took : 29 ms
[2022-05-20 05:27:49] [INFO ] Applying decomposition
[2022-05-20 05:27:49] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6841640464383965778.txt' '-o' '/tmp/graph6841640464383965778.bin' '-w' '/tmp/graph6841640464383965778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6841640464383965778.bin' '-l' '-1' '-v' '-w' '/tmp/graph6841640464383965778.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:27:50] [INFO ] Decomposing Gal with order
[2022-05-20 05:27:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:27:50] [INFO ] Removed a total of 202 redundant transitions.
[2022-05-20 05:27:50] [INFO ] Flatten gal took : 144 ms
[2022-05-20 05:27:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 05:27:50] [INFO ] Time to serialize gal into /tmp/LTL9693393490148923713.gal : 10 ms
[2022-05-20 05:27:50] [INFO ] Time to serialize properties into /tmp/LTL18121127464739969494.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9693393490148923713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18121127464739969494.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9693393...246
Read 1 LTL properties
Checking formula 0 : !((("(i18.i0.i3.u436.p1399==1)")U((G(X(!("((i2.u37.p111==1)&&(i2.u48.p147==1))"))))U(("(i17.u401.p1287==1)")U(G("(i3.i1.i1.u68.p215!=1...163
Formula 0 simplified : !("(i18.i0.i3.u436.p1399==1)" U (GX!"((i2.u37.p111==1)&&(i2.u48.p147==1))" U ("(i17.u401.p1287==1)" U G"(i3.i1.i1.u68.p215!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4334208959627382497
[2022-05-20 05:28:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4334208959627382497
Running compilation step : cd /tmp/ltsmin4334208959627382497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1916 ms.
Running link step : cd /tmp/ltsmin4334208959627382497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4334208959627382497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([](X(!(LTLAPp1==true))) U ((LTLAPp2==true) U []((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 204839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p1)))'
Support contains 2 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1341 transition count 1201
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1341 transition count 1201
Applied a total of 14 rules in 76 ms. Remains 1341 /1348 variables (removed 7) and now considering 1201/1208 (removed 7) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:28:20] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:28:21] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:28:21] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:28:21] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:28:22] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:28:22] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1348 places, 1201/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1348 places, 1201/1208 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s753 1), p1:(EQ s1018 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 603 reset in 272 ms.
Product exploration explored 100000 steps with 596 reset in 344 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1341 stabilizing places and 318/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 311 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:28:24] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:28:24] [INFO ] [Real]Absence check using 221 positive place invariants in 250 ms returned sat
[2022-05-20 05:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 05:28:29] [INFO ] [Real]Absence check using state equation in 4380 ms returned sat
[2022-05-20 05:28:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 05:28:29] [INFO ] [Nat]Absence check using 221 positive place invariants in 179 ms returned sat
[2022-05-20 05:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 05:28:34] [INFO ] [Nat]Absence check using state equation in 4107 ms returned sat
[2022-05-20 05:28:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2022-05-20 05:28:34] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-20 05:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-05-20 05:28:34] [INFO ] Computed and/alt/rep : 1200/1781/1200 causal constraints (skipped 0 transitions) in 88 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 05:28:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1341 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1340 transition count 920
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1060 transition count 920
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 560 place count 1060 transition count 760
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 880 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1548 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1549 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1551 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1669 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1671 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1672 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1672 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1676 place count 501 transition count 420
Applied a total of 1676 rules in 180 ms. Remains 501 /1341 variables (removed 840) and now considering 420/1201 (removed 781) transitions.
// Phase 1: matrix 420 rows 501 cols
[2022-05-20 05:28:44] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:28:44] [INFO ] Implicit Places using invariants in 379 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 381 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1341 places, 420/1201 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 418
Applied a total of 4 rules in 12 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2022-05-20 05:28:44] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:45] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2022-05-20 05:28:45] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 05:28:45] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1341 places, 418/1201 transitions.
Finished structural reductions, in 2 iterations. Remains : 497/1341 places, 418/1201 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/497 stabilizing places and 4/418 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 418 rows 497 cols
[2022-05-20 05:28:46] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:46] [INFO ] [Real]Absence check using 218 positive place invariants in 75 ms returned sat
[2022-05-20 05:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 05:28:46] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2022-05-20 05:28:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 05:28:47] [INFO ] [Nat]Absence check using 218 positive place invariants in 70 ms returned sat
[2022-05-20 05:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 05:28:47] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-05-20 05:28:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 05:28:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2022-05-20 05:28:47] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-20 05:28:48] [INFO ] Deduced a trap composed of 8 places in 488 ms of which 1 ms to minimize.
[2022-05-20 05:28:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-20 05:28:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2022-05-20 05:28:48] [INFO ] Computed and/alt/rep : 412/683/412 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-20 05:28:51] [INFO ] Added : 356 causal constraints over 72 iterations in 3362 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17042 reset in 439 ms.
Stack based approach found an accepted trace after 148 steps with 22 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-01 finished in 31577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!G(p0)))||F(p0)) U (G(p0)&&p1)))'
Support contains 2 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1347 transition count 927
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1067 transition count 927
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 560 place count 1067 transition count 772
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 870 place count 912 transition count 772
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 876 place count 906 transition count 766
Iterating global reduction 2 with 6 rules applied. Total rules applied 882 place count 906 transition count 766
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 882 place count 906 transition count 760
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 894 place count 900 transition count 760
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 2 with 670 rules applied. Total rules applied 1564 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1565 place count 565 transition count 424
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 1567 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1683 place count 506 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 503 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1690 place count 501 transition count 419
Applied a total of 1690 rules in 198 ms. Remains 501 /1348 variables (removed 847) and now considering 419/1208 (removed 789) transitions.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:28:52] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:28:52] [INFO ] Implicit Places using invariants in 616 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 617 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1348 places, 419/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 417
Applied a total of 4 rules in 13 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2022-05-20 05:28:52] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:53] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 417 rows 497 cols
[2022-05-20 05:28:53] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:28:53] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1348 places, 417/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 497/1348 places, 417/1208 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s380 1), p0:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 399 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-03 finished in 1975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 2 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1347 transition count 927
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 1067 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 1066 transition count 926
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 562 place count 1066 transition count 771
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 872 place count 911 transition count 771
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 878 place count 905 transition count 765
Iterating global reduction 3 with 6 rules applied. Total rules applied 884 place count 905 transition count 765
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 884 place count 905 transition count 759
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 896 place count 899 transition count 759
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1562 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1563 place count 566 transition count 425
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 1565 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1683 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1685 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1686 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1686 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1690 place count 501 transition count 420
Applied a total of 1690 rules in 123 ms. Remains 501 /1348 variables (removed 847) and now considering 420/1208 (removed 788) transitions.
// Phase 1: matrix 420 rows 501 cols
[2022-05-20 05:28:54] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:28:54] [INFO ] Implicit Places using invariants in 649 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 650 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1348 places, 420/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 418
Applied a total of 4 rules in 11 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2022-05-20 05:28:54] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:28:55] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2022-05-20 05:28:55] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:55] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-20 05:28:56] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1348 places, 418/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 497/1348 places, 418/1208 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s305 1), p0:(NEQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 20211 reset in 527 ms.
Stack based approach found an accepted trace after 164 steps with 35 reset with depth 3 and stack size 3 in 2 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-05 finished in 2792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(G(F(X(p0))))))))'
Support contains 1 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1347 transition count 926
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1066 transition count 926
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 562 place count 1066 transition count 771
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 872 place count 911 transition count 771
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 2 with 5 rules applied. Total rules applied 882 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 882 place count 906 transition count 761
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 892 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1568 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1569 place count 563 transition count 422
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 1571 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1689 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1692 place count 500 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1696 place count 498 transition count 417
Applied a total of 1696 rules in 114 ms. Remains 498 /1348 variables (removed 850) and now considering 417/1208 (removed 791) transitions.
// Phase 1: matrix 417 rows 498 cols
[2022-05-20 05:28:57] [INFO ] Computed 220 place invariants in 0 ms
[2022-05-20 05:28:57] [INFO ] Implicit Places using invariants in 245 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 249 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1348 places, 417/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 10 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2022-05-20 05:28:57] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:57] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 415 rows 494 cols
[2022-05-20 05:28:57] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:57] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1348 places, 415/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 494/1348 places, 415/1208 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-06 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 s250 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]]
Product exploration explored 100000 steps with 25 reset in 401 ms.
Product exploration explored 100000 steps with 21 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4472 steps, including 1 resets, run visited all 1 properties in 24 ms. (steps per millisecond=186 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 494 /494 variables (removed 0) and now considering 415/415 (removed 0) transitions.
// Phase 1: matrix 415 rows 494 cols
[2022-05-20 05:28:59] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:59] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 415 rows 494 cols
[2022-05-20 05:28:59] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:28:59] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2022-05-20 05:28:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 415 rows 494 cols
[2022-05-20 05:28:59] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:00] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/494 places, 415/415 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4819 steps, including 1 resets, run visited all 1 properties in 22 ms. (steps per millisecond=219 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11 reset in 378 ms.
Stack based approach found an accepted trace after 56584 steps with 9 reset with depth 5694 and stack size 5281 in 266 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-06 finished in 4444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1347 transition count 926
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 1066 transition count 926
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 562 place count 1066 transition count 772
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 870 place count 912 transition count 772
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 876 place count 906 transition count 766
Iterating global reduction 2 with 6 rules applied. Total rules applied 882 place count 906 transition count 766
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 882 place count 906 transition count 760
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 894 place count 900 transition count 760
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1566 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 564 transition count 423
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 1569 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1689 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1690 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1690 place count 501 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1694 place count 499 transition count 418
Applied a total of 1694 rules in 119 ms. Remains 499 /1348 variables (removed 849) and now considering 418/1208 (removed 790) transitions.
// Phase 1: matrix 418 rows 499 cols
[2022-05-20 05:29:01] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:29:01] [INFO ] Implicit Places using invariants in 250 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1348 places, 418/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 10 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:29:01] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:01] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:29:01] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:02] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1348 places, 416/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 495/1348 places, 416/1208 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s406 1) (EQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 364 reset in 375 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-07 finished in 1597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(!(F(p1) U p2))))'
Support contains 3 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1347 transition count 930
Reduce places removed 277 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 279 rules applied. Total rules applied 556 place count 1070 transition count 928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 1068 transition count 928
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 558 place count 1068 transition count 774
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 866 place count 914 transition count 774
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 872 place count 908 transition count 768
Iterating global reduction 3 with 6 rules applied. Total rules applied 878 place count 908 transition count 768
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 878 place count 908 transition count 762
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 890 place count 902 transition count 762
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1560 place count 567 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1561 place count 567 transition count 426
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 1563 place count 566 transition count 425
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1679 place count 508 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1681 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1682 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1682 place count 505 transition count 421
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1686 place count 503 transition count 421
Applied a total of 1686 rules in 120 ms. Remains 503 /1348 variables (removed 845) and now considering 421/1208 (removed 787) transitions.
// Phase 1: matrix 421 rows 503 cols
[2022-05-20 05:29:03] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:29:03] [INFO ] Implicit Places using invariants in 306 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 307 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1348 places, 421/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 419
Applied a total of 4 rules in 12 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:03] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:03] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:03] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:04] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 499/1348 places, 419/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 499/1348 places, 419/1208 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) p2), (NOT p0), (NOT p0), p2, (AND p1 p2)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s250 1), p1:(EQ s405 1), p2:(EQ s226 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 10 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 599 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/499 stabilizing places and 2/419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 9 factoid took 540 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 :1
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:06] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:06] [INFO ] [Real]Absence check using 218 positive place invariants in 23 ms returned sat
[2022-05-20 05:29:06] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:29:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 23 ms returned sat
[2022-05-20 05:29:06] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:06] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 05:29:06] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-20 05:29:06] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p2 p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F p0), (F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 1025 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:08] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:08] [INFO ] [Real]Absence check using 218 positive place invariants in 71 ms returned sat
[2022-05-20 05:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 05:29:08] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-20 05:29:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 05:29:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 68 ms returned sat
[2022-05-20 05:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 05:29:09] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-05-20 05:29:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2022-05-20 05:29:09] [INFO ] Computed and/alt/rep : 414/653/414 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-20 05:29:12] [INFO ] Added : 374 causal constraints over 75 iterations in 3048 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:12] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:12] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:12] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:13] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:13] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:13] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 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/499 stabilizing places and 2/419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 527 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :5
Finished Best-First random walk after 1007 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p2 p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F p0), (F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 759 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:15] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:29:15] [INFO ] [Real]Absence check using 218 positive place invariants in 73 ms returned sat
[2022-05-20 05:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 05:29:16] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2022-05-20 05:29:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 05:29:16] [INFO ] [Nat]Absence check using 218 positive place invariants in 69 ms returned sat
[2022-05-20 05:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 05:29:16] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-05-20 05:29:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2022-05-20 05:29:16] [INFO ] Computed and/alt/rep : 414/653/414 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-20 05:29:19] [INFO ] Added : 374 causal constraints over 75 iterations in 2988 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Product exploration explored 100000 steps with 5 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), p2, (AND p2 p1)]
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 10 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2022-05-20 05:29:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:21] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:21] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Product exploration explored 100000 steps with 2 reset in 432 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 82 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 19021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p0))&&X(p1)))||X(F(p2)))))'
Support contains 4 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1342 transition count 1202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1342 transition count 1202
Applied a total of 12 rules in 93 ms. Remains 1342 /1348 variables (removed 6) and now considering 1202/1208 (removed 6) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:22] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:29:22] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:22] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:29:23] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:23] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:24] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1348 places, 1202/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1348 places, 1202/1208 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p2:(EQ s323 0), p1:(EQ s1004 0), p0:(OR (EQ s302 0) (EQ s304 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 659 ms.
Product exploration explored 100000 steps with 33333 reset in 658 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1342 stabilizing places and 319/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-020B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLFireability-10 finished in 3708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X(p1)))'
Support contains 5 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1341 transition count 1201
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1341 transition count 1201
Applied a total of 14 rules in 80 ms. Remains 1341 /1348 variables (removed 7) and now considering 1201/1208 (removed 7) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:25] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:29:26] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:26] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:29:27] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:27] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:27] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1348 places, 1201/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1348 places, 1201/1208 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s642 1) (EQ s735 1) (NOT (AND (EQ s638 1) (EQ s656 1)))), p0:(EQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-12 finished in 2087 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (F(p1) U p2)))'
Support contains 4 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1343 transition count 1203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1343 transition count 1203
Applied a total of 10 rules in 94 ms. Remains 1343 /1348 variables (removed 5) and now considering 1203/1208 (removed 5) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:29:27] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:29:28] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:29:28] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:29] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:29:29] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:29] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1348 places, 1203/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1343/1348 places, 1203/1208 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s1101 1) (EQ s1119 1)), p1:(EQ s1212 1), p0:(EQ s194 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 975 reset in 371 ms.
Stack based approach found an accepted trace after 5832 steps with 101 reset with depth 3946 and stack size 3946 in 27 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-13 finished in 2842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 3 out of 1348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1342 transition count 1202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1342 transition count 1202
Applied a total of 12 rules in 77 ms. Remains 1342 /1348 variables (removed 6) and now considering 1202/1208 (removed 6) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:30] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:29:31] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:31] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:29:31] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:29:31] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:32] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1348 places, 1202/1208 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1348 places, 1202/1208 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s982 1) (AND (EQ s1103 1) (EQ s1145 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34 reset in 381 ms.
Stack based approach found an accepted trace after 1494 steps with 0 reset with depth 1495 and stack size 1495 in 7 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-14 finished in 2512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1347 transition count 927
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1067 transition count 927
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1067 transition count 771
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 911 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 878 place count 905 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 884 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 905 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 900 transition count 760
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1566 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 564 transition count 423
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 1569 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1689 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1690 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1690 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1694 place count 499 transition count 418
Applied a total of 1694 rules in 121 ms. Remains 499 /1348 variables (removed 849) and now considering 418/1208 (removed 790) transitions.
// Phase 1: matrix 418 rows 499 cols
[2022-05-20 05:29:33] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:29:33] [INFO ] Implicit Places using invariants in 245 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 246 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1348 places, 418/1208 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 11 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:29:33] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:33] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:29:33] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:34] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1348 places, 416/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 495/1348 places, 416/1208 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-15 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 s441 1) (EQ s453 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Stack based approach found an accepted trace after 180 steps with 0 reset with depth 181 and stack size 181 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-15 finished in 1490 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(X(!p1)) U (p2 U G(p3)))))'
Found a SL insensitive property : ShieldPPPt-PT-020B-LTLFireability-00
Stuttering acceptance computed with spot in 654 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Support contains 5 out of 1348 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1348/1348 places, 1208/1208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1347 transition count 930
Reduce places removed 277 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 279 rules applied. Total rules applied 556 place count 1070 transition count 928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 558 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 870 place count 912 transition count 772
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 875 place count 907 transition count 767
Iterating global reduction 3 with 5 rules applied. Total rules applied 880 place count 907 transition count 767
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 880 place count 907 transition count 763
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 888 place count 903 transition count 763
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1558 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 568 transition count 427
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 1561 place count 567 transition count 426
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 509 transition count 426
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 507 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 506 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1680 place count 506 transition count 422
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1684 place count 504 transition count 422
Applied a total of 1684 rules in 143 ms. Remains 504 /1348 variables (removed 844) and now considering 422/1208 (removed 786) transitions.
// Phase 1: matrix 422 rows 504 cols
[2022-05-20 05:29:35] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:29:35] [INFO ] Implicit Places using invariants in 240 ms returned [487, 491]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 502/1348 places, 422/1208 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 500 transition count 420
Applied a total of 4 rules in 12 ms. Remains 500 /502 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:35] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:29:35] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:36] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:36] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 500/1348 places, 420/1208 transitions.
Finished structural reductions, in 2 iterations. Remains : 500/1348 places, 420/1208 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=3 dest: 6}, { cond=(AND p2 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 5}, { cond=(AND p3 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(NEQ s74 1), p0:(EQ s457 1), p2:(EQ s424 1), p1:(AND (EQ s30 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26773 reset in 540 ms.
Product exploration explored 100000 steps with 26797 reset in 602 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/500 stabilizing places and 3/420 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p3 p1))), (X p3), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p3 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p3 p1)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p3 p2 (NOT p1))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p3 p2 (NOT p1)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
Knowledge based reduction with 32 factoid took 1940 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:41] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:41] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:29:41] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-20 05:29:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:41] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:41] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:41] [INFO ] [Nat]Absence check using 218 positive place invariants in 26 ms returned sat
[2022-05-20 05:29:41] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:42] [INFO ] After 137ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-20 05:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-20 05:29:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-05-20 05:29:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-20 05:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-05-20 05:29:42] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 139 ms.
[2022-05-20 05:29:42] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 420/420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 499 transition count 419
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 499 transition count 419
Applied a total of 5 rules in 20 ms. Remains 499 /500 variables (removed 1) and now considering 419/420 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/500 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 94347 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94347 steps, saw 70339 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:46] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:46] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:29:47] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-20 05:29:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:47] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:47] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:47] [INFO ] [Nat]Absence check using 218 positive place invariants in 26 ms returned sat
[2022-05-20 05:29:47] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:47] [INFO ] After 177ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:47] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-05-20 05:29:48] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:48] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:48] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:48] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:49] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2022-05-20 05:29:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:49] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:49] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 499 transition count 419
Applied a total of 116 rules in 15 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:29:49] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:49] [INFO ] [Real]Absence check using 218 positive place invariants in 48 ms returned sat
[2022-05-20 05:29:49] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-20 05:29:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 05:29:49] [INFO ] After 67ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:49] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:29:50] [INFO ] [Nat]Absence check using 218 positive place invariants in 47 ms returned sat
[2022-05-20 05:29:50] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:50] [INFO ] After 137ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2022-05-20 05:29:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2022-05-20 05:29:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-20 05:29:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2022-05-20 05:29:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 215 ms
[2022-05-20 05:29:50] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 135 ms.
[2022-05-20 05:29:51] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 05:29:51] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:29:51] [INFO ] Flatten gal took : 13 ms
[2022-05-20 05:29:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7894670141031014539.gal : 2 ms
[2022-05-20 05:29:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13166756096828388457.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms654259227982541531;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7894670141031014539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13166756096828388457.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13166756096828388457.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :48 after 82
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :82 after 125
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :125 after 451
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :451 after 8064
Reachability property apf12 is true.
Reachability property apf8 is true.
Reachability property apf1 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :8064 after 99694
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :99694 after 936491
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :936491 after 1.15716e+07
Reachability property apf14 is true.
Reachability property apf11 is true.
Reachability property apf9 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.15716e+07 after 3.29433e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.29433e+10 after 1.40722e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.40722e+11 after 1.02262e+25
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.02262e+25 after 3.73727e+57
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.12871e+71,3.4451,35612,2,1963,24,128432,8,0,2423,198007,0
Total reachable state count : 3.128708199123122857543509491173568880547e+71

Verifying 8 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,8000,3.44692,35876,2,526,24,128432,9,0,2427,198007,0
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,8000,3.44807,35876,2,526,24,128432,9,0,2429,198007,0
Reachability property apf7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,8000,3.44953,35876,2,526,24,128432,9,0,2430,198007,0
Reachability property apf8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf8,8000,3.45019,35876,2,526,24,128432,10,0,2433,198007,0
Reachability property apf9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf9,3.6993e+59,3.45256,35876,2,1235,24,128432,11,0,2440,198007,0
Reachability property apf11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf11,8000,3.45332,35876,2,526,24,128432,12,0,2441,198007,0
Reachability property apf12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf12,8000,3.45398,35876,2,526,24,128432,13,0,2442,198007,0
Reachability property apf14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf14,1.95814e+10,3.45452,35876,2,710,24,128432,14,0,2443,198007,0
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p3 p1))), (X p3), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p3 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p3 p1)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p3 p2 (NOT p1))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p3 p2 (NOT p1)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (F p2), (F (NOT p3)), (F (AND p2 p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 p3))]
Knowledge based reduction with 32 factoid took 2371 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 297 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Support contains 4 out of 500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 420/420 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 420/420 (removed 0) transitions.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:57] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:57] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:57] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:29:58] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:29:58] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:29:58] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 420/420 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/500 stabilizing places and 3/420 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2 p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 18 factoid took 974 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) 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 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 118 ms. (steps per millisecond=84 ) 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 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) 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
Running SMT prover for 11 properties.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:30:00] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:00] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:30:00] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2022-05-20 05:30:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:30:00] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:30:00] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 05:30:01] [INFO ] [Nat]Absence check using 218 positive place invariants in 27 ms returned sat
[2022-05-20 05:30:01] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 05:30:01] [INFO ] After 185ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-20 05:30:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-20 05:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-05-20 05:30:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-20 05:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-20 05:30:02] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 174 ms.
[2022-05-20 05:30:02] [INFO ] After 1304ms 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 8 properties in 72 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 420/420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 499 transition count 419
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 499 transition count 419
Applied a total of 5 rules in 17 ms. Remains 499 /500 variables (removed 1) and now considering 419/420 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/500 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:02] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:30:02] [INFO ] [Real]Absence check using 218 positive place invariants in 48 ms returned sat
[2022-05-20 05:30:02] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:30:02] [INFO ] [Nat]Absence check using 218 positive place invariants in 39 ms returned sat
[2022-05-20 05:30:02] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:30:02] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:03] [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 24 ms.
[2022-05-20 05:30:03] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 516304 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516304 steps, saw 399751 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:06] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:06] [INFO ] [Real]Absence check using 218 positive place invariants in 34 ms returned sat
[2022-05-20 05:30:06] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:30:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2022-05-20 05:30:06] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:30:06] [INFO ] After 46ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:06] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-20 05:30:06] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:06] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:06] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:06] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:30:07] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2022-05-20 05:30:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:07] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:07] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 499/499 places, 419/419 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 499 transition count 419
Applied a total of 116 rules in 14 ms. Remains 499 /499 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 499 cols
[2022-05-20 05:30:07] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:30:07] [INFO ] [Real]Absence check using 218 positive place invariants in 48 ms returned sat
[2022-05-20 05:30:07] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:30:07] [INFO ] [Nat]Absence check using 218 positive place invariants in 46 ms returned sat
[2022-05-20 05:30:08] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 05:30:08] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:08] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-20 05:30:08] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 05:30:08] [INFO ] Flatten gal took : 19 ms
[2022-05-20 05:30:08] [INFO ] Flatten gal took : 15 ms
[2022-05-20 05:30:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3257941257681951778.gal : 17 ms
[2022-05-20 05:30:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7363964550909677040.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4786072506759394657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3257941257681951778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7363964550909677040.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7363964550909677040.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 82
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :82 after 125
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :125 after 451
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :451 after 8064
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8064 after 99694
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :99694 after 4.82535e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.82535e+06 after 7.80091e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.80091e+09 after 3.76022e+14
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.76022e+14 after 1.03113e+47
Detected timeout of ITS tools.
[2022-05-20 05:30:23] [INFO ] Flatten gal took : 13 ms
[2022-05-20 05:30:23] [INFO ] Applying decomposition
[2022-05-20 05:30:23] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5090515225554630618.txt' '-o' '/tmp/graph5090515225554630618.bin' '-w' '/tmp/graph5090515225554630618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5090515225554630618.bin' '-l' '-1' '-v' '-w' '/tmp/graph5090515225554630618.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:30:23] [INFO ] Decomposing Gal with order
[2022-05-20 05:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:30:23] [INFO ] Removed a total of 59 redundant transitions.
[2022-05-20 05:30:23] [INFO ] Flatten gal took : 73 ms
[2022-05-20 05:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2022-05-20 05:30:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2128317729114979934.gal : 4 ms
[2022-05-20 05:30:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5903698762722866932.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4786072506759394657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2128317729114979934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5903698762722866932.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5903698762722866932.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 220032
Reachability property apf6 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.29158e+64,5.10046,169372,703,147,340132,466,594,991369,80,2906,0
Total reachable state count : 2.291580749637344538556201010342344070542e+64

Verifying 1 reachability properties.
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,2.07808e+58,5.11509,169372,145,44,340132,466,617,991369,89,2906,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2 p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (AND p1 p2)), (F (AND p1 (NOT p2) p3)), (F (AND (NOT p1) p2 (NOT p3))), (F p2), (F (AND p2 (NOT p3))), (F (NOT p3)), (F (AND p2 p3)), (F (NOT (AND (NOT p2) p3))), (F (AND p1 p3)), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p2) (NOT p3))), (F p1), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p2 p3))]
Knowledge based reduction with 18 factoid took 1313 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 226 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 254 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 26850 reset in 634 ms.
Product exploration explored 100000 steps with 26663 reset in 614 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), p1, (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (NOT p3), (NOT p3)]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 420/420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 421/420 (removed -1) transitions.
[2022-05-20 05:30:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 421 rows 500 cols
[2022-05-20 05:30:32] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:32] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 421/420 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 421/420 transitions.
Product exploration explored 100000 steps with 26782 reset in 2135 ms.
Product exploration explored 100000 steps with 26821 reset in 2175 ms.
Built C files in :
/tmp/ltsmin449236358857687622
[2022-05-20 05:30:37] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin449236358857687622
Running compilation step : cd /tmp/ltsmin449236358857687622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin449236358857687622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin449236358857687622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8812637530680147185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 420/420 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 420/420 (removed 0) transitions.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:30:52] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:52] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:30:52] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:30:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 05:30:52] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 500 cols
[2022-05-20 05:30:52] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:30:53] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 420/420 transitions.
Built C files in :
/tmp/ltsmin12673981534990046621
[2022-05-20 05:30:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12673981534990046621
Running compilation step : cd /tmp/ltsmin12673981534990046621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin12673981534990046621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12673981534990046621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3932037657652963638.hoa' '--buchi-type=spotba'
LTSmin run took 1703 ms.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 80832 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 05:30:55] [INFO ] Flatten gal took : 29 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 399630 ms.

BK_STOP 1653024655612

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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