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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 569K 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-030B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653027610736

Running Version 202205111006
[2022-05-20 06:20:11] [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 06:20:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:20:12] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-20 06:20:12] [INFO ] Transformed 2343 places.
[2022-05-20 06:20:12] [INFO ] Transformed 2133 transitions.
[2022-05-20 06:20:12] [INFO ] Found NUPN structural information;
[2022-05-20 06:20:12] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 326 places :
Symmetric choice reduction at 0 with 326 rule applications. Total rules 326 place count 2017 transition count 1807
Iterating global reduction 0 with 326 rules applied. Total rules applied 652 place count 2017 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 653 place count 2016 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 654 place count 2016 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 655 place count 2015 transition count 1805
Iterating global reduction 0 with 1 rules applied. Total rules applied 656 place count 2015 transition count 1805
Applied a total of 656 rules in 940 ms. Remains 2015 /2343 variables (removed 328) and now considering 1805/2133 (removed 328) transitions.
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:20:13] [INFO ] Computed 331 place invariants in 32 ms
[2022-05-20 06:20:14] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:20:14] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:20:15] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:20:15] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:20:16] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2015/2343 places, 1805/2133 transitions.
Finished structural reductions, in 1 iterations. Remains : 2015/2343 places, 1805/2133 transitions.
Support contains 41 out of 2015 places after structural reductions.
[2022-05-20 06:20:16] [INFO ] Flatten gal took : 145 ms
[2022-05-20 06:20:16] [INFO ] Flatten gal took : 83 ms
[2022-05-20 06:20:17] [INFO ] Input system was already deterministic with 1805 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 703 ms. (steps per millisecond=14 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:20:18] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-20 06:20:19] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-20 06:20:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 98 ms returned sat
[2022-05-20 06:20:22] [INFO ] After 1785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-20 06:20:22] [INFO ] Deduced a trap composed of 20 places in 346 ms of which 4 ms to minimize.
[2022-05-20 06:20:23] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 1 ms to minimize.
[2022-05-20 06:20:23] [INFO ] Deduced a trap composed of 23 places in 368 ms of which 1 ms to minimize.
[2022-05-20 06:20:24] [INFO ] Deduced a trap composed of 25 places in 340 ms of which 2 ms to minimize.
[2022-05-20 06:20:24] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 2 ms to minimize.
[2022-05-20 06:20:24] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 2 ms to minimize.
[2022-05-20 06:20:25] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2022-05-20 06:20:25] [INFO ] Deduced a trap composed of 26 places in 332 ms of which 1 ms to minimize.
[2022-05-20 06:20:26] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 1 ms to minimize.
[2022-05-20 06:20:26] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 1 ms to minimize.
[2022-05-20 06:20:26] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 1 ms to minimize.
[2022-05-20 06:20:27] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2022-05-20 06:20:27] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 2 ms to minimize.
[2022-05-20 06:20:27] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 0 ms to minimize.
[2022-05-20 06:20:28] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 1 ms to minimize.
[2022-05-20 06:20:28] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
[2022-05-20 06:20:29] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 1 ms to minimize.
[2022-05-20 06:20:29] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 1 ms to minimize.
[2022-05-20 06:20:29] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2022-05-20 06:20:30] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 1 ms to minimize.
[2022-05-20 06:20:30] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 1 ms to minimize.
[2022-05-20 06:20:30] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 1 ms to minimize.
[2022-05-20 06:20:31] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 0 ms to minimize.
[2022-05-20 06:20:31] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 1 ms to minimize.
[2022-05-20 06:20:31] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 0 ms to minimize.
[2022-05-20 06:20:31] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 0 ms to minimize.
[2022-05-20 06:20:32] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 1 ms to minimize.
[2022-05-20 06:20:32] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 1 ms to minimize.
[2022-05-20 06:20:32] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 1 ms to minimize.
[2022-05-20 06:20:33] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2022-05-20 06:20:33] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 0 ms to minimize.
[2022-05-20 06:20:33] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 1 ms to minimize.
[2022-05-20 06:20:34] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 0 ms to minimize.
[2022-05-20 06:20:34] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2022-05-20 06:20:34] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 1 ms to minimize.
[2022-05-20 06:20:34] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 1 ms to minimize.
[2022-05-20 06:20:35] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 2 ms to minimize.
[2022-05-20 06:20:35] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2022-05-20 06:20:35] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 1 ms to minimize.
[2022-05-20 06:20:35] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 2 ms to minimize.
[2022-05-20 06:20:36] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 1 ms to minimize.
[2022-05-20 06:20:36] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2022-05-20 06:20:36] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 14088 ms
[2022-05-20 06:20:36] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 1 ms to minimize.
[2022-05-20 06:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2022-05-20 06:20:37] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2022-05-20 06:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-20 06:20:37] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 0 ms to minimize.
[2022-05-20 06:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-20 06:20:38] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2022-05-20 06:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2022-05-20 06:20:38] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 0 ms to minimize.
[2022-05-20 06:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2022-05-20 06:20:39] [INFO ] After 19098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1201 ms.
[2022-05-20 06:20:40] [INFO ] After 21805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 642 ms.
Support contains 26 out of 2015 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Drop transitions removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 402 rules applied. Total rules applied 402 place count 2015 transition count 1403
Reduce places removed 402 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 405 rules applied. Total rules applied 807 place count 1613 transition count 1400
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 810 place count 1610 transition count 1400
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 810 place count 1610 transition count 1165
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1280 place count 1375 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1282 place count 1373 transition count 1163
Iterating global reduction 3 with 2 rules applied. Total rules applied 1284 place count 1373 transition count 1163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1284 place count 1373 transition count 1161
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1288 place count 1371 transition count 1161
Performed 502 Post agglomeration using F-continuation condition.Transition count delta: 502
Deduced a syphon composed of 502 places in 2 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2292 place count 869 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2293 place count 869 transition count 658
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2295 place count 868 transition count 657
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 2459 place count 786 transition count 657
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 4 with 87 rules applied. Total rules applied 2546 place count 786 transition count 657
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2547 place count 785 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2548 place count 784 transition count 656
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2548 place count 784 transition count 654
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2552 place count 782 transition count 654
Applied a total of 2552 rules in 446 ms. Remains 782 /2015 variables (removed 1233) and now considering 654/1805 (removed 1151) transitions.
Finished structural reductions, in 1 iterations. Remains : 782/2015 places, 654/1805 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 654 rows 782 cols
[2022-05-20 06:20:43] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 06:20:43] [INFO ] [Real]Absence check using 330 positive place invariants in 41 ms returned sat
[2022-05-20 06:20:43] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-20 06:20:43] [INFO ] [Nat]Absence check using 330 positive place invariants in 48 ms returned sat
[2022-05-20 06:20:44] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-20 06:20:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:20:45] [INFO ] After 364ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-20 06:20:45] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 346 ms.
[2022-05-20 06:20:45] [INFO ] After 2286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 21 out of 782 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 782/782 places, 654/654 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 782 transition count 651
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 779 transition count 651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 779 transition count 650
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 778 transition count 650
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 2 with 2 rules applied. Total rules applied 10 place count 777 transition count 649
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 774 transition count 649
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 774 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 773 transition count 648
Applied a total of 18 rules in 100 ms. Remains 773 /782 variables (removed 9) and now considering 648/654 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 773/782 places, 648/654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 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 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) 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 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 64 ms. (steps per millisecond=156 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 648 rows 773 cols
[2022-05-20 06:20:47] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 06:20:47] [INFO ] [Real]Absence check using 330 positive place invariants in 46 ms returned sat
[2022-05-20 06:20:47] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 06:20:47] [INFO ] [Nat]Absence check using 330 positive place invariants in 48 ms returned sat
[2022-05-20 06:20:48] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 06:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:20:48] [INFO ] After 288ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-20 06:20:48] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-20 06:20:48] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2022-05-20 06:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2022-05-20 06:20:49] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-05-20 06:20:49] [INFO ] After 2058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 17 out of 773 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 773/773 places, 648/648 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 773 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 772 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 772 transition count 646
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 771 transition count 646
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 771 transition count 646
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 770 transition count 645
Applied a total of 6 rules in 51 ms. Remains 770 /773 variables (removed 3) and now considering 645/648 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/773 places, 645/648 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 11) seen :3
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 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 645 rows 770 cols
[2022-05-20 06:20:50] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 06:20:50] [INFO ] [Real]Absence check using 330 positive place invariants in 48 ms returned sat
[2022-05-20 06:20:50] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 06:20:50] [INFO ] [Nat]Absence check using 330 positive place invariants in 43 ms returned sat
[2022-05-20 06:20:51] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 06:20:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:20:51] [INFO ] After 197ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 06:20:51] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 191 ms.
[2022-05-20 06:20:52] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 13 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 645/645 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 770 transition count 644
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 769 transition count 644
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 8 place count 766 transition count 641
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 765 transition count 640
Applied a total of 9 rules in 42 ms. Remains 765 /770 variables (removed 5) and now considering 640/645 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 765/770 places, 640/645 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 122784 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122784 steps, saw 102961 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 640 rows 765 cols
[2022-05-20 06:20:55] [INFO ] Computed 330 place invariants in 8 ms
[2022-05-20 06:20:56] [INFO ] [Real]Absence check using 330 positive place invariants in 47 ms returned sat
[2022-05-20 06:20:56] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 06:20:56] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2022-05-20 06:20:57] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 06:20:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:20:57] [INFO ] After 181ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 06:20:57] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-05-20 06:20:57] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 13 out of 765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 765/765 places, 640/640 transitions.
Applied a total of 0 rules in 13 ms. Remains 765 /765 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 765/765 places, 640/640 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 765/765 places, 640/640 transitions.
Applied a total of 0 rules in 13 ms. Remains 765 /765 variables (removed 0) and now considering 640/640 (removed 0) transitions.
// Phase 1: matrix 640 rows 765 cols
[2022-05-20 06:20:57] [INFO ] Computed 330 place invariants in 1 ms
[2022-05-20 06:20:58] [INFO ] Implicit Places using invariants in 346 ms returned [748, 752]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 348 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 763/765 places, 640/640 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 761 transition count 638
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 638
Applied a total of 4 rules in 20 ms. Remains 761 /763 variables (removed 2) and now considering 638/640 (removed 2) transitions.
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:20:58] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:20:58] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:20:58] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:20:59] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 761/765 places, 638/640 transitions.
Finished structural reductions, in 2 iterations. Remains : 761/765 places, 638/640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 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 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 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 138698 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138698 steps, saw 114852 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:21:02] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:21:03] [INFO ] [Real]Absence check using 328 positive place invariants in 47 ms returned sat
[2022-05-20 06:21:03] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 06:21:03] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-05-20 06:21:03] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 06:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:21:04] [INFO ] After 195ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 06:21:04] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-20 06:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-20 06:21:04] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 193 ms.
[2022-05-20 06:21:04] [INFO ] After 1431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 13 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 638/638 transitions.
Applied a total of 0 rules in 16 ms. Remains 761 /761 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 638/638 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 638/638 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 638/638 (removed 0) transitions.
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:21:04] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:21:05] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:21:05] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:21:05] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2022-05-20 06:21:05] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:21:05] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:21:06] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 638/638 transitions.
Partial Free-agglomeration rule applied 168 times.
Drop transitions removed 168 transitions
Iterating global reduction 0 with 168 rules applied. Total rules applied 168 place count 761 transition count 638
Applied a total of 168 rules in 26 ms. Remains 761 /761 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 761 cols
[2022-05-20 06:21:06] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:21:06] [INFO ] [Real]Absence check using 328 positive place invariants in 46 ms returned sat
[2022-05-20 06:21:06] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 06:21:06] [INFO ] [Nat]Absence check using 328 positive place invariants in 45 ms returned sat
[2022-05-20 06:21:07] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 06:21:07] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-05-20 06:21:07] [INFO ] After 301ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 06:21:07] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2022-05-20 06:21:07] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2022-05-20 06:21:07] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2022-05-20 06:21:07] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2022-05-20 06:21:08] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-20 06:21:08] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-05-20 06:21:08] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-20 06:21:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 911 ms
[2022-05-20 06:21:08] [INFO ] After 1522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 252 ms.
[2022-05-20 06:21:08] [INFO ] After 2436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-20 06:21:08] [INFO ] Flatten gal took : 33 ms
[2022-05-20 06:21:08] [INFO ] Flatten gal took : 32 ms
[2022-05-20 06:21:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15399341673789904775.gal : 23 ms
[2022-05-20 06:21:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6364704880895003763.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14141243389335973759;'/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/ReachabilityCardinality15399341673789904775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6364704880895003763.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/ReachabilityCardinality6364704880895003763.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :16 after 480
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :480 after 593
Reachability property AtomicPropp12 is true.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :593 after 1289
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1289 after 2175
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2175 after 15727
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :15727 after 119449
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :119449 after 1.06765e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.06765e+06 after 3.11897e+08
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3.11897e+08 after 1.63465e+09
Reachability property AtomicPropp29 is true.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.63465e+09 after 8.82695e+12
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :8.82695e+12 after 2.759e+14
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.759e+14 after 4.97883e+14
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :4.97883e+14 after 1.99314e+16
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.99314e+16 after 1.31347e+20
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.31347e+20 after 6.66247e+23
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.66247e+23 after 8.60982e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8.60982e+27 after 2.87458e+31
Detected timeout of ITS tools.
[2022-05-20 06:21:24] [INFO ] Flatten gal took : 30 ms
[2022-05-20 06:21:24] [INFO ] Applying decomposition
[2022-05-20 06:21:24] [INFO ] Flatten gal took : 26 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/graph16222212377625280262.txt' '-o' '/tmp/graph16222212377625280262.bin' '-w' '/tmp/graph16222212377625280262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16222212377625280262.bin' '-l' '-1' '-v' '-w' '/tmp/graph16222212377625280262.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:21:24] [INFO ] Decomposing Gal with order
[2022-05-20 06:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:21:24] [INFO ] Removed a total of 170 redundant transitions.
[2022-05-20 06:21:24] [INFO ] Flatten gal took : 80 ms
[2022-05-20 06:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 12 ms.
[2022-05-20 06:21:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3696897049191359212.gal : 11 ms
[2022-05-20 06:21:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16159819857911956922.prop : 129 ms
Invoking ITS tools like this :cd /tmp/redAtoms14141243389335973759;'/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/ReachabilityCardinality3696897049191359212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16159819857911956922.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/ReachabilityCardinality16159819857911956922.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 16
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :17920 after 1.0217e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11781503549104762978
[2022-05-20 06:21:39] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11781503549104762978
Running compilation step : cd /tmp/ltsmin11781503549104762978;'/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 1440 ms.
Running link step : cd /tmp/ltsmin11781503549104762978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11781503549104762978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldPPPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 5 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2011 transition count 1801
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2011 transition count 1801
Applied a total of 8 rules in 147 ms. Remains 2011 /2015 variables (removed 4) and now considering 1801/1805 (removed 4) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:21:55] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:21:55] [INFO ] Implicit Places using invariants in 557 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:21:55] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 06:21:57] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:21:57] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-20 06:21:58] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2015 places, 1801/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2015 places, 1801/1805 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s1103 0) (EQ s1128 0)), p1:(AND (OR (AND (EQ s1103 1) (EQ s1128 1)) (EQ s1605 1)) (EQ s1232 1) (EQ s1264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63364 steps with 0 reset in 436 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-00 finished in 4013 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p2)||p1)&&p0)))'
Support contains 4 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2012 transition count 1802
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2012 transition count 1802
Applied a total of 6 rules in 156 ms. Remains 2012 /2015 variables (removed 3) and now considering 1802/1805 (removed 3) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:21:59] [INFO ] Computed 331 place invariants in 12 ms
[2022-05-20 06:21:59] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:21:59] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-20 06:22:01] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:22:01] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:22:02] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2015 places, 1802/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2015 places, 1802/1805 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s916 1) (EQ s1009 1)), p1:(OR (EQ s1211 0) (EQ s436 0)), p2:(EQ s436 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2 reset in 537 ms.
Stack based approach found an accepted trace after 10940 steps with 0 reset with depth 10941 and stack size 1205 in 90 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-01 finished in 4082 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((G(X(X(X(p0))))||p1)))))'
Support contains 2 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2011 transition count 1801
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2011 transition count 1801
Applied a total of 8 rules in 150 ms. Remains 2011 /2015 variables (removed 4) and now considering 1801/1805 (removed 4) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:22:03] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:22:03] [INFO ] Implicit Places using invariants in 575 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:22:03] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:22:05] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:22:05] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:22:06] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2015 places, 1801/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2015 places, 1801/1805 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1596 1), p1:(EQ s1526 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 887 ms.
Product exploration explored 100000 steps with 33333 reset in 868 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2011 stabilizing places and 478/1801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-030B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLFireability-02 finished in 5394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2014 transition count 1384
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1594 transition count 1384
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 840 place count 1594 transition count 1147
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1314 place count 1357 transition count 1147
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1318 place count 1353 transition count 1143
Iterating global reduction 2 with 4 rules applied. Total rules applied 1322 place count 1353 transition count 1143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1322 place count 1353 transition count 1139
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1330 place count 1349 transition count 1139
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 0 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2342 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2343 place count 843 transition count 632
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 2345 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2523 place count 753 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2525 place count 751 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2526 place count 750 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2526 place count 750 transition count 627
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 2530 place count 748 transition count 627
Applied a total of 2530 rules in 267 ms. Remains 748 /2015 variables (removed 1267) and now considering 627/1805 (removed 1178) transitions.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:08] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 06:22:09] [INFO ] Implicit Places using invariants in 335 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 338 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 746/2015 places, 627/1805 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 744 transition count 625
Applied a total of 4 rules in 21 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2022-05-20 06:22:09] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:22:09] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 625 rows 744 cols
[2022-05-20 06:22:09] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:22:10] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 744/2015 places, 625/1805 transitions.
Finished structural reductions, in 2 iterations. Remains : 744/2015 places, 625/1805 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 488 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-03 finished in 2148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(p0)) U G((p1 U p2))))'
Support contains 3 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2012 transition count 1802
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2012 transition count 1802
Applied a total of 6 rules in 152 ms. Remains 2012 /2015 variables (removed 3) and now considering 1802/1805 (removed 3) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:22:10] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:22:11] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:22:11] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:22:13] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:22:13] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:22:13] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2015 places, 1802/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2015 places, 1802/1805 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), p0, (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 6}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s419 1), p1:(EQ s1523 1), p0:(EQ s269 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 33414 reset in 896 ms.
Product exploration explored 100000 steps with 33348 reset in 895 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (OR p2 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 896 ms. Reduced automaton from 8 states, 22 edges and 3 AP to 6 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 93962 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93962 steps, saw 65041 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:22:20] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:22:21] [INFO ] [Real]Absence check using 331 positive place invariants in 100 ms returned sat
[2022-05-20 06:22:21] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 06:22:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 96 ms returned sat
[2022-05-20 06:22:23] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 06:22:23] [INFO ] Deduced a trap composed of 29 places in 321 ms of which 1 ms to minimize.
[2022-05-20 06:22:24] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2022-05-20 06:22:24] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 1 ms to minimize.
[2022-05-20 06:22:25] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 1 ms to minimize.
[2022-05-20 06:22:25] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2022-05-20 06:22:25] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 1 ms to minimize.
[2022-05-20 06:22:26] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 0 ms to minimize.
[2022-05-20 06:22:26] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 1 ms to minimize.
[2022-05-20 06:22:26] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 0 ms to minimize.
[2022-05-20 06:22:27] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 1 ms to minimize.
[2022-05-20 06:22:27] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 0 ms to minimize.
[2022-05-20 06:22:27] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2022-05-20 06:22:28] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 0 ms to minimize.
[2022-05-20 06:22:28] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 1 ms to minimize.
[2022-05-20 06:22:28] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
[2022-05-20 06:22:28] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2022-05-20 06:22:29] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 0 ms to minimize.
[2022-05-20 06:22:29] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 1 ms to minimize.
[2022-05-20 06:22:29] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 0 ms to minimize.
[2022-05-20 06:22:30] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2022-05-20 06:22:30] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2022-05-20 06:22:30] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2022-05-20 06:22:30] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2022-05-20 06:22:31] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2022-05-20 06:22:31] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2022-05-20 06:22:31] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2022-05-20 06:22:31] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2022-05-20 06:22:32] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2022-05-20 06:22:32] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 1 ms to minimize.
[2022-05-20 06:22:32] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8822 ms
[2022-05-20 06:22:32] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2022-05-20 06:22:33] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2022-05-20 06:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2022-05-20 06:22:33] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2022-05-20 06:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-05-20 06:22:34] [INFO ] After 11822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 611 ms.
[2022-05-20 06:22:34] [INFO ] After 13243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 452 ms.
Support contains 3 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2012 transition count 1386
Reduce places removed 416 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 833 place count 1596 transition count 1385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 834 place count 1595 transition count 1385
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 834 place count 1595 transition count 1146
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1312 place count 1356 transition count 1146
Performed 512 Post agglomeration using F-continuation condition.Transition count delta: 512
Deduced a syphon composed of 512 places in 1 ms
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 3 with 1024 rules applied. Total rules applied 2336 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2337 place count 844 transition count 633
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 2339 place count 843 transition count 632
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2513 place count 756 transition count 632
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 2602 place count 756 transition count 632
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2603 place count 755 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2604 place count 754 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2608 place count 752 transition count 629
Applied a total of 2608 rules in 221 ms. Remains 752 /2012 variables (removed 1260) and now considering 629/1802 (removed 1173) transitions.
Finished structural reductions, in 1 iterations. Remains : 752/2012 places, 629/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 629 rows 752 cols
[2022-05-20 06:22:35] [INFO ] Computed 330 place invariants in 1 ms
[2022-05-20 06:22:35] [INFO ] [Real]Absence check using 330 positive place invariants in 43 ms returned sat
[2022-05-20 06:22:35] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:22:36] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:22:36] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:22:36] [INFO ] After 84ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:36] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-20 06:22:36] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 752 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 752/752 places, 629/629 transitions.
Applied a total of 0 rules in 11 ms. Remains 752 /752 variables (removed 0) and now considering 629/629 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 752/752 places, 629/629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 167160 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167160 steps, saw 139085 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 629 rows 752 cols
[2022-05-20 06:22:40] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 06:22:40] [INFO ] [Real]Absence check using 330 positive place invariants in 47 ms returned sat
[2022-05-20 06:22:40] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:22:40] [INFO ] [Nat]Absence check using 330 positive place invariants in 46 ms returned sat
[2022-05-20 06:22:40] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:22:40] [INFO ] After 80ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:40] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 06:22:41] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 752 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 752/752 places, 629/629 transitions.
Applied a total of 0 rules in 11 ms. Remains 752 /752 variables (removed 0) and now considering 629/629 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 752/752 places, 629/629 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 752/752 places, 629/629 transitions.
Applied a total of 0 rules in 12 ms. Remains 752 /752 variables (removed 0) and now considering 629/629 (removed 0) transitions.
// Phase 1: matrix 629 rows 752 cols
[2022-05-20 06:22:41] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 06:22:41] [INFO ] Implicit Places using invariants in 367 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 368 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 750/752 places, 629/629 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 748 transition count 627
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 748 transition count 627
Applied a total of 4 rules in 22 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:41] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:22:41] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:41] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:22:42] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 748/752 places, 627/629 transitions.
Finished structural reductions, in 2 iterations. Remains : 748/752 places, 627/629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 152512 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152512 steps, saw 126706 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:45] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:22:45] [INFO ] [Real]Absence check using 328 positive place invariants in 41 ms returned sat
[2022-05-20 06:22:45] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:22:46] [INFO ] [Nat]Absence check using 328 positive place invariants in 40 ms returned sat
[2022-05-20 06:22:46] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:46] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-05-20 06:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-20 06:22:46] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-20 06:22:46] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 748 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 14 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 748/748 places, 627/627 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:46] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:22:47] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:47] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:22:47] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2022-05-20 06:22:47] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:47] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:22:48] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 748/748 places, 627/627 transitions.
Partial Free-agglomeration rule applied 171 times.
Drop transitions removed 171 transitions
Iterating global reduction 0 with 171 rules applied. Total rules applied 171 place count 748 transition count 627
Applied a total of 171 rules in 25 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:22:48] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:22:48] [INFO ] [Real]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-05-20 06:22:48] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:22:48] [INFO ] [Nat]Absence check using 328 positive place invariants in 44 ms returned sat
[2022-05-20 06:22:48] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:48] [INFO ] State equation strengthened by 169 read => feed constraints.
[2022-05-20 06:22:48] [INFO ] After 162ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:49] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 06:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-20 06:22:49] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2022-05-20 06:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-20 06:22:49] [INFO ] After 624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-05-20 06:22:49] [INFO ] After 1208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:22:49] [INFO ] Flatten gal took : 25 ms
[2022-05-20 06:22:49] [INFO ] Flatten gal took : 24 ms
[2022-05-20 06:22:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16250664389956183603.gal : 3 ms
[2022-05-20 06:22:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7518970758386861645.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3021201185569436110;'/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/ReachabilityCardinality16250664389956183603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7518970758386861645.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/ReachabilityCardinality7518970758386861645.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :66 after 176
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :176 after 1336
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1336 after 50082
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :50082 after 1.06839e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.06839e+06 after 7.93022e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.93022e+07 after 5.37838e+08
Reachability property apf3 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.37838e+08 after 3.79111e+12
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.79111e+12 after 3.39038e+13
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.39038e+13 after 6.17221e+15
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.17221e+15 after 2.7044e+19
Reachability property apf5 is true.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.7044e+19 after 2.18958e+23
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.18958e+23 after 1.18929e+30
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.18929e+30 after 5.45491e+36
Detected timeout of ITS tools.
[2022-05-20 06:23:04] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:23:04] [INFO ] Applying decomposition
[2022-05-20 06:23:04] [INFO ] Flatten gal took : 21 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/graph14706305895324409545.txt' '-o' '/tmp/graph14706305895324409545.bin' '-w' '/tmp/graph14706305895324409545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14706305895324409545.bin' '-l' '-1' '-v' '-w' '/tmp/graph14706305895324409545.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:23:04] [INFO ] Decomposing Gal with order
[2022-05-20 06:23:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:23:04] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-20 06:23:04] [INFO ] Flatten gal took : 43 ms
[2022-05-20 06:23:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 7 ms.
[2022-05-20 06:23:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9487995829469797892.gal : 4 ms
[2022-05-20 06:23:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13983765733381635018.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3021201185569436110;'/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/ReachabilityCardinality9487995829469797892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13983765733381635018.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/ReachabilityCardinality13983765733381635018.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6240 after 1.00152e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.00152e+11 after 1.92465e+28
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8436233630546343671
[2022-05-20 06:23:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8436233630546343671
Running compilation step : cd /tmp/ltsmin8436233630546343671;'/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 1036 ms.
Running link step : cd /tmp/ltsmin8436233630546343671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8436233630546343671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf4==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (OR p2 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (OR p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1330 ms. Reduced automaton from 6 states, 20 edges and 3 AP to 6 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:23:36] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:23:37] [INFO ] [Real]Absence check using 331 positive place invariants in 411 ms returned sat
[2022-05-20 06:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:23:48] [INFO ] [Real]Absence check using state equation in 10429 ms returned sat
[2022-05-20 06:23:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:23:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 421 ms returned sat
[2022-05-20 06:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:24:00] [INFO ] [Nat]Absence check using state equation in 10962 ms returned sat
[2022-05-20 06:24:00] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 92 ms.
[2022-05-20 06:24:04] [INFO ] Deduced a trap composed of 21 places in 834 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
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 06:24:04] [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 p2)
Could not prove EG (NOT p2)
Support contains 3 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2011 transition count 1385
Reduce places removed 416 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 833 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 834 place count 1594 transition count 1384
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 834 place count 1594 transition count 1145
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1312 place count 1355 transition count 1145
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2332 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2333 place count 845 transition count 634
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 2335 place count 844 transition count 633
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2509 place count 757 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2511 place count 755 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2512 place count 754 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2512 place count 754 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2516 place count 752 transition count 629
Applied a total of 2516 rules in 174 ms. Remains 752 /2012 variables (removed 1260) and now considering 629/1802 (removed 1173) transitions.
// Phase 1: matrix 629 rows 752 cols
[2022-05-20 06:24:04] [INFO ] Computed 330 place invariants in 1 ms
[2022-05-20 06:24:04] [INFO ] Implicit Places using invariants in 364 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2012 places, 629/1802 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 748 transition count 627
Applied a total of 4 rules in 19 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:04] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:24:05] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:05] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:24:05] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2012 places, 627/1802 transitions.
Finished structural reductions, in 2 iterations. Remains : 748/2012 places, 627/1802 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1636 ms. Reduced automaton from 6 states, 20 edges and 3 AP to 6 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:08] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:24:08] [INFO ] [Real]Absence check using 328 positive place invariants in 46 ms returned sat
[2022-05-20 06:24:08] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:24:08] [INFO ] [Nat]Absence check using 328 positive place invariants in 45 ms returned sat
[2022-05-20 06:24:08] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:24:08] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-20 06:24:08] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 748 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 748/748 places, 627/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 193281 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193281 steps, saw 139274 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:12] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:24:12] [INFO ] [Real]Absence check using 328 positive place invariants in 47 ms returned sat
[2022-05-20 06:24:12] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:24:12] [INFO ] [Nat]Absence check using 328 positive place invariants in 42 ms returned sat
[2022-05-20 06:24:13] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:24:13] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-20 06:24:13] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 748 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 10 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 748/748 places, 627/627 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 10 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:13] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:24:13] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:13] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:24:14] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2022-05-20 06:24:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:14] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 06:24:14] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 748/748 places, 627/627 transitions.
Partial Free-agglomeration rule applied 171 times.
Drop transitions removed 171 transitions
Iterating global reduction 0 with 171 rules applied. Total rules applied 171 place count 748 transition count 627
Applied a total of 171 rules in 28 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:14] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:24:14] [INFO ] [Real]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-05-20 06:24:14] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:24:14] [INFO ] [Nat]Absence check using 328 positive place invariants in 44 ms returned sat
[2022-05-20 06:24:15] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:24:15] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-20 06:24:15] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:24:15] [INFO ] Flatten gal took : 19 ms
[2022-05-20 06:24:15] [INFO ] Flatten gal took : 19 ms
[2022-05-20 06:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16768824492888905079.gal : 2 ms
[2022-05-20 06:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8091021764574115334.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5957524327399072396;'/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/ReachabilityCardinality16768824492888905079.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8091021764574115334.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/ReachabilityCardinality8091021764574115334.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 68
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :68 after 287
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :287 after 15638
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :15638 after 85630
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :85630 after 7.48806e+06
Reachability property apf3 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.48806e+06 after 3.10361e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.10361e+14 after 1.8432e+21
Reachability property apf5 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.8432e+21 after 1.66283e+36
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.66283e+36 after 2.31928e+53
Reachability property apf4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 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,9.47445e+85,2.82317,23416,2,3110,21,84450,6,0,3622,95773,0
Total reachable state count : 9.47444771608068095971666175668955748169e+85

Verifying 3 reachability properties.
Reachability property apf3 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
apf3,5.12e+13,2.82596,23680,2,903,21,84450,7,0,3630,95773,0
Reachability property apf4 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
apf4,5.12e+13,2.82686,23680,2,903,21,84450,8,0,3633,95773,0
Reachability property apf5 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
apf5,5.12e+13,2.82787,23680,2,903,21,84450,9,0,3637,95773,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (OR p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1063 ms. Reduced automaton from 6 states, 20 edges and 3 AP to 6 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 627 rows 748 cols
[2022-05-20 06:24:19] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 06:24:20] [INFO ] [Real]Absence check using 328 positive place invariants in 153 ms returned sat
[2022-05-20 06:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:24:21] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2022-05-20 06:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:24:21] [INFO ] [Nat]Absence check using 328 positive place invariants in 164 ms returned sat
[2022-05-20 06:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:24:22] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2022-05-20 06:24:22] [INFO ] Computed and/alt/rep : 623/971/623 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-20 06:24:28] [INFO ] Added : 517 causal constraints over 104 iterations in 6086 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (OR (AND p0 p1) (AND p0 p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33260 reset in 770 ms.
Stack based approach found an accepted trace after 6 steps with 1 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 139236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U X((p1&&((p2 U G(p3))||p4))))))'
Support contains 6 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2012 transition count 1802
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2012 transition count 1802
Applied a total of 6 rules in 148 ms. Remains 2012 /2015 variables (removed 3) and now considering 1802/1805 (removed 3) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:24:30] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:24:30] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:24:30] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:24:32] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:24:32] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:24:33] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2015 places, 1802/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2015 places, 1802/1805 transitions.
Stuttering acceptance computed with spot in 574 ms :[(OR (NOT p1) (AND (NOT p3) (NOT p4))), (OR (NOT p1) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p0), (OR (NOT p1) (AND (NOT p3) (NOT p4))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p4)))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=1 dest: 7}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=1 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p4) p3 p2), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={0} source=4 dest: 7}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=7 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p3) p2 (NOT p0)) (AND (NOT p4) (NOT p3) p2 (NOT p0))), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p4) p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p3 p2) (AND (NOT p4) p3 p2)), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p4) (NOT p3) p2)), acceptance={0} source=7 dest: 7}, { cond=(OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=7 dest: 9}, { cond=(OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(NOT p3), acceptance={} source=9 dest: 3}, { cond=p3, acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=10 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p4) p3 p2), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={0} source=10 dest: 7}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(EQ s69 1), p0:(AND (EQ s920 1) (EQ s922 1)), p4:(EQ s1085 1), p3:(EQ s1723 1), p2:(EQ s1399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 492 ms.
Stack based approach found an accepted trace after 2386 steps with 0 reset with depth 2387 and stack size 2387 in 14 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-05 finished in 4377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(p1)) U X(((!p2 U p2)&&G(p3)&&p0))))'
Support contains 6 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2011 transition count 1801
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2011 transition count 1801
Applied a total of 8 rules in 142 ms. Remains 2011 /2015 variables (removed 4) and now considering 1801/1805 (removed 4) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:34] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-20 06:24:34] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:35] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 06:24:36] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:36] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-20 06:24:37] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2015 places, 1801/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2015 places, 1801/1805 transitions.
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p3), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={} source=2 dest: 6}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(NOT p3), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s506 1) (EQ s538 1)), p0:(EQ s804 1), p3:(EQ s759 1), p2:(AND (EQ s1895 1) (EQ s1920 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 0 reset in 489 ms.
Stack based approach found an accepted trace after 1086 steps with 0 reset with depth 1087 and stack size 1087 in 6 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-07 finished in 4286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U p1))'
Support contains 2 out of 2015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2014 transition count 1386
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 1596 transition count 1386
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 836 place count 1596 transition count 1149
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1310 place count 1359 transition count 1149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1314 place count 1355 transition count 1145
Iterating global reduction 2 with 4 rules applied. Total rules applied 1318 place count 1355 transition count 1145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1318 place count 1355 transition count 1141
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1326 place count 1351 transition count 1141
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2338 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 845 transition count 634
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 2341 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2517 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2519 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2520 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2520 place count 753 transition count 629
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 2524 place count 751 transition count 629
Applied a total of 2524 rules in 226 ms. Remains 751 /2015 variables (removed 1264) and now considering 629/1805 (removed 1176) transitions.
// Phase 1: matrix 629 rows 751 cols
[2022-05-20 06:24:38] [INFO ] Computed 330 place invariants in 0 ms
[2022-05-20 06:24:39] [INFO ] Implicit Places using invariants in 339 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 340 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2015 places, 629/1805 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 747 transition count 627
Applied a total of 4 rules in 18 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2022-05-20 06:24:39] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:24:39] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 627 rows 747 cols
[2022-05-20 06:24:39] [INFO ] Computed 328 place invariants in 4 ms
[2022-05-20 06:24:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 06:24:40] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2015 places, 627/1805 transitions.
Finished structural reductions, in 2 iterations. Remains : 747/2015 places, 627/1805 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, p1]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s280 1), p0:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-12 finished in 1691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(p0)) U p1))))'
Support contains 1 out of 2015 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2011 transition count 1801
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2011 transition count 1801
Applied a total of 8 rules in 149 ms. Remains 2011 /2015 variables (removed 4) and now considering 1801/1805 (removed 4) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:40] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-20 06:24:40] [INFO ] Implicit Places using invariants in 539 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:40] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:24:42] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:42] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:24:43] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2015 places, 1801/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2015 places, 1801/1805 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1323 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 485 ms.
Stack based approach found an accepted trace after 7082 steps with 2 reset with depth 2943 and stack size 2943 in 46 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-13 finished in 3875 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(F(F(F(p0))))&&p1))||X(G(p2))))'
Support contains 3 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2011 transition count 1801
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2011 transition count 1801
Applied a total of 8 rules in 141 ms. Remains 2011 /2015 variables (removed 4) and now considering 1801/1805 (removed 4) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:44] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:24:44] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:44] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:24:46] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:46] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:24:47] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2015 places, 1801/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2015 places, 1801/1805 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s1146 1), p2:(EQ s804 0), p0:(EQ s1133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 711 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2011 stabilizing places and 478/1801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 657 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 168193 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168193 steps, saw 111324 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:24:52] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:24:52] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:24:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 94 ms returned sat
[2022-05-20 06:24:53] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:24:54] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 1 ms to minimize.
[2022-05-20 06:24:54] [INFO ] Deduced a trap composed of 16 places in 408 ms of which 1 ms to minimize.
[2022-05-20 06:24:55] [INFO ] Deduced a trap composed of 24 places in 402 ms of which 1 ms to minimize.
[2022-05-20 06:24:55] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 1 ms to minimize.
[2022-05-20 06:24:56] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 1 ms to minimize.
[2022-05-20 06:24:56] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 1 ms to minimize.
[2022-05-20 06:24:57] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 1 ms to minimize.
[2022-05-20 06:24:57] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 1 ms to minimize.
[2022-05-20 06:24:58] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 1 ms to minimize.
[2022-05-20 06:24:58] [INFO ] Deduced a trap composed of 21 places in 364 ms of which 1 ms to minimize.
[2022-05-20 06:24:58] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 1 ms to minimize.
[2022-05-20 06:24:59] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2022-05-20 06:24:59] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2022-05-20 06:25:00] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 1 ms to minimize.
[2022-05-20 06:25:00] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 1 ms to minimize.
[2022-05-20 06:25:00] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 1 ms to minimize.
[2022-05-20 06:25:01] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2022-05-20 06:25:01] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 1 ms to minimize.
[2022-05-20 06:25:02] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 1 ms to minimize.
[2022-05-20 06:25:02] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 1 ms to minimize.
[2022-05-20 06:25:02] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 1 ms to minimize.
[2022-05-20 06:25:03] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2022-05-20 06:25:03] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 1 ms to minimize.
[2022-05-20 06:25:03] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2022-05-20 06:25:04] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2022-05-20 06:25:04] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 1 ms to minimize.
[2022-05-20 06:25:04] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 0 ms to minimize.
[2022-05-20 06:25:05] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2022-05-20 06:25:05] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 1 ms to minimize.
[2022-05-20 06:25:05] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 0 ms to minimize.
[2022-05-20 06:25:06] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2022-05-20 06:25:06] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 1 ms to minimize.
[2022-05-20 06:25:06] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2022-05-20 06:25:07] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2022-05-20 06:25:07] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2022-05-20 06:25:07] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2022-05-20 06:25:08] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 1 ms to minimize.
[2022-05-20 06:25:08] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2022-05-20 06:25:08] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 0 ms to minimize.
[2022-05-20 06:25:08] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2022-05-20 06:25:09] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 1 ms to minimize.
[2022-05-20 06:25:09] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 1 ms to minimize.
[2022-05-20 06:25:09] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 1 ms to minimize.
[2022-05-20 06:25:09] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 1 ms to minimize.
[2022-05-20 06:25:10] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 0 ms to minimize.
[2022-05-20 06:25:10] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 1 ms to minimize.
[2022-05-20 06:25:10] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2022-05-20 06:25:10] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2022-05-20 06:25:11] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2022-05-20 06:25:11] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2022-05-20 06:25:11] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 1 ms to minimize.
[2022-05-20 06:25:11] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2022-05-20 06:25:12] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2022-05-20 06:25:12] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 1 ms to minimize.
[2022-05-20 06:25:12] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2022-05-20 06:25:12] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 0 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 1 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 0 ms to minimize.
[2022-05-20 06:25:13] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 19963 ms
[2022-05-20 06:25:13] [INFO ] After 20799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-20 06:25:14] [INFO ] After 21193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 2011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2011 transition count 1382
Reduce places removed 419 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 839 place count 1592 transition count 1381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 840 place count 1591 transition count 1381
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 840 place count 1591 transition count 1142
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1318 place count 1352 transition count 1142
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2336 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2337 place count 843 transition count 632
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 2339 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2517 place count 753 transition count 631
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 2606 place count 753 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2607 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2608 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2608 place count 751 transition count 628
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 2612 place count 749 transition count 628
Applied a total of 2612 rules in 216 ms. Remains 749 /2011 variables (removed 1262) and now considering 628/1801 (removed 1173) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/2011 places, 628/1801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310352 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310352 steps, saw 259023 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 628 rows 749 cols
[2022-05-20 06:25:17] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 06:25:17] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:25:17] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:25:17] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:25:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:25:17] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:25:17] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 06:25:17] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 749/749 places, 628/628 transitions.
Applied a total of 0 rules in 10 ms. Remains 749 /749 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/749 places, 628/628 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 749/749 places, 628/628 transitions.
Applied a total of 0 rules in 9 ms. Remains 749 /749 variables (removed 0) and now considering 628/628 (removed 0) transitions.
// Phase 1: matrix 628 rows 749 cols
[2022-05-20 06:25:17] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 06:25:18] [INFO ] Implicit Places using invariants in 360 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 747/749 places, 628/628 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 745 transition count 626
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 19 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2022-05-20 06:25:18] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:25:18] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 626 rows 745 cols
[2022-05-20 06:25:18] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:25:19] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 745/749 places, 626/628 transitions.
Finished structural reductions, in 2 iterations. Remains : 745/749 places, 626/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 206422 steps, run visited all 1 properties in 1995 ms. (steps per millisecond=103 )
Probabilistic random walk after 206422 steps, saw 171319 distinct states, run finished after 1997 ms. (steps per millisecond=103 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 18 factoid took 561 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2011 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Applied a total of 0 rules in 79 ms. Remains 2011 /2011 variables (removed 0) and now considering 1801/1801 (removed 0) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:25:22] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 06:25:22] [INFO ] Implicit Places using invariants in 552 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:25:22] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 06:25:24] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:25:24] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:25:25] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2011 places, 1801/1801 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167232 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167232 steps, saw 110714 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 06:25:28] [INFO ] Computed 331 place invariants in 12 ms
[2022-05-20 06:25:28] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:25:29] [INFO ] [Nat]Absence check using 331 positive place invariants in 95 ms returned sat
[2022-05-20 06:25:29] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:25:30] [INFO ] Deduced a trap composed of 22 places in 423 ms of which 2 ms to minimize.
[2022-05-20 06:25:30] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 1 ms to minimize.
[2022-05-20 06:25:31] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 2 ms to minimize.
[2022-05-20 06:25:31] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 2 ms to minimize.
[2022-05-20 06:25:32] [INFO ] Deduced a trap composed of 23 places in 396 ms of which 1 ms to minimize.
[2022-05-20 06:25:32] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 2 ms to minimize.
[2022-05-20 06:25:33] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 1 ms to minimize.
[2022-05-20 06:25:33] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2022-05-20 06:25:34] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 1 ms to minimize.
[2022-05-20 06:25:34] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 1 ms to minimize.
[2022-05-20 06:25:35] [INFO ] Deduced a trap composed of 34 places in 370 ms of which 1 ms to minimize.
[2022-05-20 06:25:35] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 2 ms to minimize.
[2022-05-20 06:25:35] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 1 ms to minimize.
[2022-05-20 06:25:36] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2022-05-20 06:25:36] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 1 ms to minimize.
[2022-05-20 06:25:37] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 1 ms to minimize.
[2022-05-20 06:25:37] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 1 ms to minimize.
[2022-05-20 06:25:37] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 2 ms to minimize.
[2022-05-20 06:25:38] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 1 ms to minimize.
[2022-05-20 06:25:38] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 1 ms to minimize.
[2022-05-20 06:25:39] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 1 ms to minimize.
[2022-05-20 06:25:39] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 1 ms to minimize.
[2022-05-20 06:25:39] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 1 ms to minimize.
[2022-05-20 06:25:40] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 0 ms to minimize.
[2022-05-20 06:25:40] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 1 ms to minimize.
[2022-05-20 06:25:40] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 1 ms to minimize.
[2022-05-20 06:25:41] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 1 ms to minimize.
[2022-05-20 06:25:41] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 1 ms to minimize.
[2022-05-20 06:25:41] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 0 ms to minimize.
[2022-05-20 06:25:42] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 1 ms to minimize.
[2022-05-20 06:25:42] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2022-05-20 06:25:42] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2022-05-20 06:25:43] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2022-05-20 06:25:43] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 0 ms to minimize.
[2022-05-20 06:25:43] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 0 ms to minimize.
[2022-05-20 06:25:44] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 0 ms to minimize.
[2022-05-20 06:25:44] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 0 ms to minimize.
[2022-05-20 06:25:44] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2022-05-20 06:25:44] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2022-05-20 06:25:45] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 1 ms to minimize.
[2022-05-20 06:25:45] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 1 ms to minimize.
[2022-05-20 06:25:45] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 0 ms to minimize.
[2022-05-20 06:25:46] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 1 ms to minimize.
[2022-05-20 06:25:46] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 1 ms to minimize.
[2022-05-20 06:25:46] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 1 ms to minimize.
[2022-05-20 06:25:46] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2022-05-20 06:25:47] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 1 ms to minimize.
[2022-05-20 06:25:47] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2022-05-20 06:25:47] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 1 ms to minimize.
[2022-05-20 06:25:47] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2022-05-20 06:25:48] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2022-05-20 06:25:48] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2022-05-20 06:25:48] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2022-05-20 06:25:48] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2022-05-20 06:25:48] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2022-05-20 06:25:49] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 0 ms to minimize.
[2022-05-20 06:25:49] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 1 ms to minimize.
[2022-05-20 06:25:49] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2022-05-20 06:25:49] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2022-05-20 06:25:49] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2022-05-20 06:25:50] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-05-20 06:25:50] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 20268 ms
[2022-05-20 06:25:50] [INFO ] After 21093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 06:25:50] [INFO ] After 21495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 2011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2011 transition count 1382
Reduce places removed 419 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 839 place count 1592 transition count 1381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 840 place count 1591 transition count 1381
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 840 place count 1591 transition count 1142
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1318 place count 1352 transition count 1142
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2336 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2337 place count 843 transition count 632
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 2339 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2517 place count 753 transition count 631
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 2606 place count 753 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2607 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2608 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2608 place count 751 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2612 place count 749 transition count 628
Applied a total of 2612 rules in 191 ms. Remains 749 /2011 variables (removed 1262) and now considering 628/1801 (removed 1173) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/2011 places, 628/1801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 312767 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312767 steps, saw 260994 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 628 rows 749 cols
[2022-05-20 06:25:53] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 06:25:53] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:25:53] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:25:54] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:25:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:25:54] [INFO ] After 27ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:25:54] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 06:25:54] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 749/749 places, 628/628 transitions.
Applied a total of 0 rules in 10 ms. Remains 749 /749 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/749 places, 628/628 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 749/749 places, 628/628 transitions.
Applied a total of 0 rules in 10 ms. Remains 749 /749 variables (removed 0) and now considering 628/628 (removed 0) transitions.
// Phase 1: matrix 628 rows 749 cols
[2022-05-20 06:25:54] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 06:25:54] [INFO ] Implicit Places using invariants in 365 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 366 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 747/749 places, 628/628 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 745 transition count 626
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 30 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2022-05-20 06:25:54] [INFO ] Computed 328 place invariants in 0 ms
[2022-05-20 06:25:54] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 626 rows 745 cols
[2022-05-20 06:25:54] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 06:25:55] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 745/749 places, 626/628 transitions.
Finished structural reductions, in 2 iterations. Remains : 745/749 places, 626/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 206422 steps, run visited all 1 properties in 1973 ms. (steps per millisecond=104 )
Probabilistic random walk after 206422 steps, saw 171319 distinct states, run finished after 1974 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 531 ms.
Entered a terminal (fully accepting) state of product in 51231 steps with 0 reset in 356 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-14 finished in 74836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1)) U p2))'
Support contains 6 out of 2015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2015/2015 places, 1805/1805 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2013 transition count 1803
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2013 transition count 1803
Applied a total of 4 rules in 187 ms. Remains 2013 /2015 variables (removed 2) and now considering 1803/1805 (removed 2) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 06:25:59] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:25:59] [INFO ] Implicit Places using invariants in 547 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 06:25:59] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 06:26:01] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 06:26:01] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:26:02] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2015 places, 1803/1805 transitions.
Finished structural reductions, in 1 iterations. Remains : 2013/2015 places, 1803/1805 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s288 1) (EQ s420 1) (AND (EQ s1060 1) (EQ s1109 1))), p1:(AND (EQ s239 1) (EQ s293 1)), p0:(EQ s420 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-15 finished in 3476 ms.
All properties solved by simple procedures.
Total runtime 350596 ms.

BK_STOP 1653027962545

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

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

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