Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300636.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679464411092

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:53:33] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-22 05:53:33] [INFO ] Transformed 1563 places.
[2023-03-22 05:53:33] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:53:33] [INFO ] Found NUPN structural information;
[2023-03-22 05:53:33] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 293 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-020B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1351 transition count 1211
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1351 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1350 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1350 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1349 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1349 transition count 1209
Applied a total of 428 rules in 539 ms. Remains 1349 /1563 variables (removed 214) and now considering 1209/1423 (removed 214) transitions.
// Phase 1: matrix 1209 rows 1349 cols
[2023-03-22 05:53:34] [INFO ] Computed 221 place invariants in 19 ms
[2023-03-22 05:53:35] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-22 05:53:35] [INFO ] Invariant cache hit.
[2023-03-22 05:53:36] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
[2023-03-22 05:53:36] [INFO ] Invariant cache hit.
[2023-03-22 05:53:37] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1349/1563 places, 1209/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3643 ms. Remains : 1349/1563 places, 1209/1423 transitions.
Support contains 47 out of 1349 places after structural reductions.
[2023-03-22 05:53:37] [INFO ] Flatten gal took : 101 ms
[2023-03-22 05:53:37] [INFO ] Flatten gal took : 50 ms
[2023-03-22 05:53:37] [INFO ] Input system was already deterministic with 1209 transitions.
Support contains 45 out of 1349 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 32) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-22 05:53:38] [INFO ] Invariant cache hit.
[2023-03-22 05:53:39] [INFO ] [Real]Absence check using 221 positive place invariants in 142 ms returned sat
[2023-03-22 05:53:39] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 05:53:40] [INFO ] [Nat]Absence check using 221 positive place invariants in 140 ms returned sat
[2023-03-22 05:53:42] [INFO ] After 1558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 05:53:42] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 5 ms to minimize.
[2023-03-22 05:53:43] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 2 ms to minimize.
[2023-03-22 05:53:43] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 1 ms to minimize.
[2023-03-22 05:53:44] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 2 ms to minimize.
[2023-03-22 05:53:44] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 2 ms to minimize.
[2023-03-22 05:53:45] [INFO ] Deduced a trap composed of 16 places in 365 ms of which 2 ms to minimize.
[2023-03-22 05:53:45] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 1 ms to minimize.
[2023-03-22 05:53:45] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2023-03-22 05:53:45] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2023-03-22 05:53:46] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2023-03-22 05:53:46] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2023-03-22 05:53:46] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 1 ms to minimize.
[2023-03-22 05:53:46] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2023-03-22 05:53:47] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2023-03-22 05:53:47] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 0 ms to minimize.
[2023-03-22 05:53:47] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2023-03-22 05:53:47] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2023-03-22 05:53:48] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2023-03-22 05:53:48] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2023-03-22 05:53:48] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2023-03-22 05:53:48] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 0 ms to minimize.
[2023-03-22 05:53:49] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 1 ms to minimize.
[2023-03-22 05:53:49] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-22 05:53:49] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 3 ms to minimize.
[2023-03-22 05:53:49] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 1 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2023-03-22 05:53:50] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8512 ms
[2023-03-22 05:53:51] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 0 ms to minimize.
[2023-03-22 05:53:51] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 1 ms to minimize.
[2023-03-22 05:53:51] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 0 ms to minimize.
[2023-03-22 05:53:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 848 ms
[2023-03-22 05:53:52] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 14 ms to minimize.
[2023-03-22 05:53:52] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:53:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 619 ms
[2023-03-22 05:53:53] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 0 ms to minimize.
[2023-03-22 05:53:53] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2023-03-22 05:53:53] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2023-03-22 05:53:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2023-03-22 05:53:54] [INFO ] After 13704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1163 ms.
[2023-03-22 05:53:55] [INFO ] After 16217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 487 ms.
Support contains 17 out of 1349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 269 place count 1349 transition count 940
Reduce places removed 269 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 273 rules applied. Total rules applied 542 place count 1080 transition count 936
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 546 place count 1076 transition count 936
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 546 place count 1076 transition count 781
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 856 place count 921 transition count 781
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 861 place count 916 transition count 776
Iterating global reduction 3 with 5 rules applied. Total rules applied 866 place count 916 transition count 776
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 866 place count 916 transition count 773
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 872 place count 913 transition count 773
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1542 place count 578 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 578 transition count 437
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 1545 place count 577 transition count 436
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1655 place count 522 transition count 436
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 1710 place count 522 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1711 place count 521 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1712 place count 520 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1712 place count 520 transition count 433
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1716 place count 518 transition count 433
Applied a total of 1716 rules in 296 ms. Remains 518 /1349 variables (removed 831) and now considering 433/1209 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 518/1349 places, 433/1209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 13) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :2
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 :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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 433 rows 518 cols
[2023-03-22 05:53:57] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-22 05:53:57] [INFO ] [Real]Absence check using 220 positive place invariants in 116 ms returned sat
[2023-03-22 05:53:57] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 05:53:58] [INFO ] [Nat]Absence check using 220 positive place invariants in 143 ms returned sat
[2023-03-22 05:53:58] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 05:53:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 05:53:59] [INFO ] After 254ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 05:53:59] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-22 05:53:59] [INFO ] After 1943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 10 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 433/433 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 518 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 517 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 517 transition count 430
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 515 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 514 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 514 transition count 429
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 514 transition count 428
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 513 transition count 428
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 12 place count 512 transition count 427
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 510 transition count 427
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 510 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 508 transition count 425
Applied a total of 19 rules in 110 ms. Remains 508 /518 variables (removed 10) and now considering 425/433 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 508/518 places, 425/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 98708 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98708 steps, saw 73725 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 425 rows 508 cols
[2023-03-22 05:54:03] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:54:03] [INFO ] [Real]Absence check using 220 positive place invariants in 31 ms returned sat
[2023-03-22 05:54:03] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 05:54:04] [INFO ] [Nat]Absence check using 220 positive place invariants in 35 ms returned sat
[2023-03-22 05:54:04] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 05:54:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:54:04] [INFO ] After 244ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 05:54:05] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-22 05:54:05] [INFO ] After 1619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 10 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 425/425 transitions.
Applied a total of 0 rules in 11 ms. Remains 508 /508 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 508/508 places, 425/425 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 425/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 508 /508 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2023-03-22 05:54:05] [INFO ] Invariant cache hit.
[2023-03-22 05:54:08] [INFO ] Implicit Places using invariants in 2977 ms returned [491, 495]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3001 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 506/508 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 504 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 504 transition count 423
Applied a total of 4 rules in 23 ms. Remains 504 /506 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 504 cols
[2023-03-22 05:54:08] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:54:09] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-22 05:54:09] [INFO ] Invariant cache hit.
[2023-03-22 05:54:09] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 504/508 places, 423/425 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3830 ms. Remains : 504/508 places, 423/425 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 94318 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94318 steps, saw 72699 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-22 05:54:13] [INFO ] Invariant cache hit.
[2023-03-22 05:54:13] [INFO ] [Real]Absence check using 218 positive place invariants in 83 ms returned sat
[2023-03-22 05:54:13] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 05:54:13] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2023-03-22 05:54:14] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 05:54:14] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-22 05:54:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-22 05:54:14] [INFO ] After 1107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-22 05:54:15] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 10 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 423/423 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 504/504 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 423/423 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2023-03-22 05:54:15] [INFO ] Invariant cache hit.
[2023-03-22 05:54:15] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-22 05:54:15] [INFO ] Invariant cache hit.
[2023-03-22 05:54:16] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-22 05:54:16] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-22 05:54:16] [INFO ] Invariant cache hit.
[2023-03-22 05:54:16] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1072 ms. Remains : 504/504 places, 423/423 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 504 transition count 423
Applied a total of 113 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 423 rows 504 cols
[2023-03-22 05:54:16] [INFO ] Computed 218 place invariants in 4 ms
[2023-03-22 05:54:16] [INFO ] [Real]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-22 05:54:16] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 05:54:16] [INFO ] [Nat]Absence check using 218 positive place invariants in 33 ms returned sat
[2023-03-22 05:54:17] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 05:54:17] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-22 05:54:17] [INFO ] After 198ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 05:54:17] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 11 ms to minimize.
[2023-03-22 05:54:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-22 05:54:18] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-22 05:54:18] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 05:54:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2023-03-22 05:54:18] [INFO ] After 1370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-22 05:54:19] [INFO ] After 2435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 321 stabilizing places and 321 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p0||G(p1)))))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 107 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-22 05:54:19] [INFO ] Computed 221 place invariants in 12 ms
[2023-03-22 05:54:20] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-22 05:54:20] [INFO ] Invariant cache hit.
[2023-03-22 05:54:21] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2023-03-22 05:54:21] [INFO ] Invariant cache hit.
[2023-03-22 05:54:22] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2677 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 503 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s1246 1), p1:(OR (NEQ s322 1) (NEQ s371 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20551 steps with 0 reset in 184 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 3476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1348 transition count 930
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 1070 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1069 transition count 929
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 558 place count 1069 transition count 775
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 872 place count 909 transition count 769
Iterating global reduction 3 with 6 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 878 place count 909 transition count 765
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1560 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1561 place count 568 transition count 427
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1563 place count 567 transition count 426
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1677 place count 510 transition count 426
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 508 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 507 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1680 place count 507 transition count 422
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 1684 place count 505 transition count 422
Applied a total of 1684 rules in 240 ms. Remains 505 /1349 variables (removed 844) and now considering 422/1209 (removed 787) transitions.
// Phase 1: matrix 422 rows 505 cols
[2023-03-22 05:54:23] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:54:23] [INFO ] Implicit Places using invariants in 310 ms returned [488, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 311 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1349 places, 422/1209 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 501 transition count 420
Applied a total of 4 rules in 15 ms. Remains 501 /503 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-22 05:54:23] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:54:23] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-22 05:54:23] [INFO ] Invariant cache hit.
[2023-03-22 05:54:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:54:24] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 501/1349 places, 420/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1801 ms. Remains : 501/1349 places, 420/1209 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s380 1), p0:(OR (EQ s429 1) (EQ s103 0) (EQ s374 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-02 finished in 2030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||(X((p2 U p3))&&p1))) U p4))))'
Support contains 7 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 153 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-22 05:54:25] [INFO ] Computed 221 place invariants in 11 ms
[2023-03-22 05:54:25] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-22 05:54:25] [INFO ] Invariant cache hit.
[2023-03-22 05:54:27] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
[2023-03-22 05:54:27] [INFO ] Invariant cache hit.
[2023-03-22 05:54:28] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2897 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 573 ms :[(NOT p4), (NOT p4), (NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p4), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s645 1) (EQ s682 1)), p0:(EQ s86 1), p1:(AND (EQ s1307 1) (EQ s1331 1)), p3:(EQ s884 1), p2:(EQ s483 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 585 ms.
Stack based approach found an accepted trace after 7467 steps with 0 reset with depth 7468 and stack size 7468 in 49 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-04 finished in 4185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 120 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-22 05:54:29] [INFO ] Computed 221 place invariants in 12 ms
[2023-03-22 05:54:29] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-22 05:54:29] [INFO ] Invariant cache hit.
[2023-03-22 05:54:31] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2436 ms to find 0 implicit places.
[2023-03-22 05:54:31] [INFO ] Invariant cache hit.
[2023-03-22 05:54:32] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3321 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s90 1) (EQ s1013 0)), p1:(OR (AND (EQ s42 1) (EQ s1275 1)) (EQ s1275 1))], 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 0 reset in 596 ms.
Stack based approach found an accepted trace after 611 steps with 0 reset with depth 612 and stack size 612 in 3 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-05 finished in 4003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 878 place count 906 transition count 766
Iterating global reduction 2 with 6 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1568 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1569 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1571 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1689 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1692 place count 501 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1696 place count 499 transition count 418
Applied a total of 1696 rules in 267 ms. Remains 499 /1349 variables (removed 850) and now considering 418/1209 (removed 791) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-22 05:54:33] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:54:34] [INFO ] Implicit Places using invariants in 664 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 665 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1349 places, 418/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 22 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2023-03-22 05:54:34] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:54:34] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-22 05:54:34] [INFO ] Invariant cache hit.
[2023-03-22 05:54:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:54:35] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1821 ms. Remains : 495/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s249 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8 reset in 481 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-07 finished in 2486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&G(p2)))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1071 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 556 place count 1070 transition count 773
Deduced a syphon composed of 157 places in 2 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 3 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1562 place count 567 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1563 place count 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1565 place count 566 transition count 425
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1681 place count 508 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1683 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1684 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1684 place count 505 transition count 421
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 1688 place count 503 transition count 421
Applied a total of 1688 rules in 216 ms. Remains 503 /1349 variables (removed 846) and now considering 421/1209 (removed 788) transitions.
// Phase 1: matrix 421 rows 503 cols
[2023-03-22 05:54:36] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:54:36] [INFO ] Implicit Places using invariants in 364 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 366 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1349 places, 421/1209 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 499 transition count 419
Applied a total of 4 rules in 30 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2023-03-22 05:54:36] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:54:36] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-22 05:54:36] [INFO ] Invariant cache hit.
[2023-03-22 05:54:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:54:37] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 499/1349 places, 419/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1515 ms. Remains : 499/1349 places, 419/1209 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s299 0), p1:(OR (EQ s384 0) (EQ s402 0)), p2:(EQ s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 466 ms.
Stack based approach found an accepted trace after 53625 steps with 0 reset with depth 53626 and stack size 15387 in 353 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-08 finished in 2660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 93 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-22 05:54:38] [INFO ] Computed 221 place invariants in 9 ms
[2023-03-22 05:54:39] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-22 05:54:39] [INFO ] Invariant cache hit.
[2023-03-22 05:54:40] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2023-03-22 05:54:40] [INFO ] Invariant cache hit.
[2023-03-22 05:54:41] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2592 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1143 1) (NEQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 630 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232514 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232514 steps, saw 142429 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:54:45] [INFO ] Invariant cache hit.
[2023-03-22 05:54:46] [INFO ] [Real]Absence check using 221 positive place invariants in 138 ms returned sat
[2023-03-22 05:54:46] [INFO ] After 638ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 05:54:47] [INFO ] Deduced a trap composed of 35 places in 671 ms of which 1 ms to minimize.
[2023-03-22 05:54:47] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2023-03-22 05:54:48] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 0 ms to minimize.
[2023-03-22 05:54:48] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 1 ms to minimize.
[2023-03-22 05:54:48] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 4 ms to minimize.
[2023-03-22 05:54:49] [INFO ] Deduced a trap composed of 29 places in 1050 ms of which 1 ms to minimize.
[2023-03-22 05:54:50] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 0 ms to minimize.
[2023-03-22 05:54:50] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 0 ms to minimize.
[2023-03-22 05:54:50] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 13 ms to minimize.
[2023-03-22 05:54:50] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 13 ms to minimize.
[2023-03-22 05:54:51] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-22 05:54:51] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:54:51] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:54:51] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 0 ms to minimize.
[2023-03-22 05:54:52] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2023-03-22 05:54:52] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2023-03-22 05:54:52] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 12 ms to minimize.
[2023-03-22 05:54:52] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-22 05:54:52] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 34 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 15 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 36 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2023-03-22 05:54:53] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-22 05:54:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7266 ms
[2023-03-22 05:54:54] [INFO ] After 7984ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:54:54] [INFO ] After 8358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:54:54] [INFO ] [Nat]Absence check using 221 positive place invariants in 88 ms returned sat
[2023-03-22 05:54:54] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:54:55] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2023-03-22 05:54:55] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 0 ms to minimize.
[2023-03-22 05:54:55] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-22 05:54:55] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2023-03-22 05:54:56] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-22 05:54:56] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 1 ms to minimize.
[2023-03-22 05:54:56] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2023-03-22 05:54:56] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2023-03-22 05:54:57] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 1 ms to minimize.
[2023-03-22 05:54:57] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 0 ms to minimize.
[2023-03-22 05:54:57] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 0 ms to minimize.
[2023-03-22 05:54:57] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2023-03-22 05:54:58] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 0 ms to minimize.
[2023-03-22 05:54:58] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-22 05:54:58] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2023-03-22 05:54:59] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 0 ms to minimize.
[2023-03-22 05:54:59] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2023-03-22 05:54:59] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-22 05:54:59] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2023-03-22 05:54:59] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2023-03-22 05:55:00] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 1 ms to minimize.
[2023-03-22 05:55:00] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2023-03-22 05:55:00] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-22 05:55:00] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2023-03-22 05:55:00] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2023-03-22 05:55:01] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 0 ms to minimize.
[2023-03-22 05:55:01] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2023-03-22 05:55:01] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2023-03-22 05:55:01] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2023-03-22 05:55:01] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6729 ms
[2023-03-22 05:55:01] [INFO ] After 7254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-22 05:55:01] [INFO ] After 7646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1738 place count 501 transition count 419
Applied a total of 1738 rules in 117 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 408 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=204 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 43 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-22 05:55:02] [INFO ] Invariant cache hit.
[2023-03-22 05:55:02] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-22 05:55:02] [INFO ] Invariant cache hit.
[2023-03-22 05:55:04] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2023-03-22 05:55:04] [INFO ] Invariant cache hit.
[2023-03-22 05:55:05] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2760 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239771 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239771 steps, saw 146699 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:55:08] [INFO ] Invariant cache hit.
[2023-03-22 05:55:08] [INFO ] [Real]Absence check using 221 positive place invariants in 245 ms returned sat
[2023-03-22 05:55:09] [INFO ] After 483ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 05:55:09] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 1 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 0 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 0 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 1 ms to minimize.
[2023-03-22 05:55:11] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2023-03-22 05:55:11] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-22 05:55:11] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2023-03-22 05:55:11] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-22 05:55:12] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 0 ms to minimize.
[2023-03-22 05:55:12] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2023-03-22 05:55:12] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 0 ms to minimize.
[2023-03-22 05:55:12] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 0 ms to minimize.
[2023-03-22 05:55:13] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
[2023-03-22 05:55:13] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-22 05:55:13] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-22 05:55:13] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 2 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-03-22 05:55:14] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 0 ms to minimize.
[2023-03-22 05:55:15] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-22 05:55:15] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-22 05:55:15] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5986 ms
[2023-03-22 05:55:15] [INFO ] After 6526ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:55:15] [INFO ] After 6941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:55:15] [INFO ] [Nat]Absence check using 221 positive place invariants in 105 ms returned sat
[2023-03-22 05:55:16] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:55:16] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 0 ms to minimize.
[2023-03-22 05:55:16] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 0 ms to minimize.
[2023-03-22 05:55:17] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 1 ms to minimize.
[2023-03-22 05:55:17] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2023-03-22 05:55:17] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 0 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 1 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 1 ms to minimize.
[2023-03-22 05:55:19] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 1 ms to minimize.
[2023-03-22 05:55:19] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 0 ms to minimize.
[2023-03-22 05:55:19] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 1 ms to minimize.
[2023-03-22 05:55:20] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2023-03-22 05:55:20] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2023-03-22 05:55:20] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 5 ms to minimize.
[2023-03-22 05:55:20] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 1 ms to minimize.
[2023-03-22 05:55:20] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 1 ms to minimize.
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 0 ms to minimize.
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 13 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2023-03-22 05:55:23] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2023-03-22 05:55:23] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6760 ms
[2023-03-22 05:55:23] [INFO ] After 7573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 05:55:23] [INFO ] After 7908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1738 place count 501 transition count 419
Applied a total of 1738 rules in 113 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished Best-First random walk after 177 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=177 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 489 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1281
Deduced a syphon composed of 378 places in 2 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1281
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 757 place count 1341 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 758 place count 1341 transition count 1281
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 2 with 140 rule applications. Total rules 898 place count 1201 transition count 1141
Deduced a syphon composed of 617 places in 1 ms
Iterating global reduction 2 with 140 rules applied. Total rules applied 1038 place count 1201 transition count 1141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 618 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1039 place count 1201 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1041 place count 1199 transition count 1139
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1043 place count 1199 transition count 1139
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 694 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1121 place count 1199 transition count 1469
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1199 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1277 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 1 ms
Applied a total of 1277 rules in 608 ms. Remains 1121 /1341 variables (removed 220) and now considering 1313/1201 (removed -112) transitions.
[2023-03-22 05:55:26] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1313 rows 1121 cols
[2023-03-22 05:55:26] [INFO ] Computed 221 place invariants in 15 ms
[2023-03-22 05:55:26] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1341 places, 1313/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1523 ms. Remains : 1121/1341 places, 1313/1201 transitions.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 48 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-22 05:55:27] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-22 05:55:27] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-22 05:55:27] [INFO ] Invariant cache hit.
[2023-03-22 05:55:28] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2023-03-22 05:55:29] [INFO ] Invariant cache hit.
[2023-03-22 05:55:29] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2684 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 51381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&F(p1))) U G(p2)))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 114 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-22 05:55:29] [INFO ] Invariant cache hit.
[2023-03-22 05:55:30] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-22 05:55:30] [INFO ] Invariant cache hit.
[2023-03-22 05:55:31] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2023-03-22 05:55:31] [INFO ] Invariant cache hit.
[2023-03-22 05:55:32] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2723 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s50 1), p0:(EQ s80 1), p1:(EQ s432 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-10 finished in 3036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 128 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-22 05:55:33] [INFO ] Invariant cache hit.
[2023-03-22 05:55:33] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-22 05:55:33] [INFO ] Invariant cache hit.
[2023-03-22 05:55:35] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2023-03-22 05:55:35] [INFO ] Invariant cache hit.
[2023-03-22 05:55:35] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2859 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 288 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1027 1) (EQ s1052 1)), p1:(AND (EQ s586 1) (EQ s635 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 35 reset in 424 ms.
Product exploration explored 100000 steps with 53 reset in 490 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:55:37] [INFO ] Invariant cache hit.
[2023-03-22 05:55:38] [INFO ] [Real]Absence check using 221 positive place invariants in 115 ms returned sat
[2023-03-22 05:55:38] [INFO ] After 637ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 05:55:39] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 1 ms to minimize.
[2023-03-22 05:55:39] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 0 ms to minimize.
[2023-03-22 05:55:39] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 7 ms to minimize.
[2023-03-22 05:55:39] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 1 ms to minimize.
[2023-03-22 05:55:40] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 1 ms to minimize.
[2023-03-22 05:55:40] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2023-03-22 05:55:40] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 1 ms to minimize.
[2023-03-22 05:55:40] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2023-03-22 05:55:41] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-22 05:55:41] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2023-03-22 05:55:41] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 1 ms to minimize.
[2023-03-22 05:55:41] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 0 ms to minimize.
[2023-03-22 05:55:42] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 0 ms to minimize.
[2023-03-22 05:55:42] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-22 05:55:42] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2023-03-22 05:55:42] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 0 ms to minimize.
[2023-03-22 05:55:43] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-22 05:55:43] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 0 ms to minimize.
[2023-03-22 05:55:43] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-22 05:55:43] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-22 05:55:43] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2023-03-22 05:55:44] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2023-03-22 05:55:44] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-22 05:55:44] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2023-03-22 05:55:44] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5748 ms
[2023-03-22 05:55:44] [INFO ] After 6446ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:55:44] [INFO ] After 6792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:55:44] [INFO ] [Nat]Absence check using 221 positive place invariants in 52 ms returned sat
[2023-03-22 05:55:45] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:55:45] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2023-03-22 05:55:46] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2023-03-22 05:55:46] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 0 ms to minimize.
[2023-03-22 05:55:46] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2023-03-22 05:55:46] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2023-03-22 05:55:47] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2023-03-22 05:55:47] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2023-03-22 05:55:47] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-22 05:55:47] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 1 ms to minimize.
[2023-03-22 05:55:48] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2023-03-22 05:55:48] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2023-03-22 05:55:48] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-22 05:55:48] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-22 05:55:49] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2023-03-22 05:55:49] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 0 ms to minimize.
[2023-03-22 05:55:49] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 1 ms to minimize.
[2023-03-22 05:55:49] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-22 05:55:49] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 0 ms to minimize.
[2023-03-22 05:55:50] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2023-03-22 05:55:50] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2023-03-22 05:55:50] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2023-03-22 05:55:51] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2023-03-22 05:55:52] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-22 05:55:52] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2023-03-22 05:55:52] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6844 ms
[2023-03-22 05:55:52] [INFO ] After 7508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-22 05:55:52] [INFO ] After 7863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 103 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 659 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=164 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 330 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 62 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-22 05:55:53] [INFO ] Invariant cache hit.
[2023-03-22 05:55:54] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-22 05:55:54] [INFO ] Invariant cache hit.
[2023-03-22 05:55:55] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2023-03-22 05:55:55] [INFO ] Invariant cache hit.
[2023-03-22 05:55:56] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:55:56] [INFO ] Invariant cache hit.
[2023-03-22 05:55:56] [INFO ] [Real]Absence check using 221 positive place invariants in 108 ms returned sat
[2023-03-22 05:55:57] [INFO ] After 590ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 05:55:57] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 1 ms to minimize.
[2023-03-22 05:55:58] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 1 ms to minimize.
[2023-03-22 05:55:58] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2023-03-22 05:55:58] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 0 ms to minimize.
[2023-03-22 05:55:59] [INFO ] Deduced a trap composed of 31 places in 678 ms of which 1 ms to minimize.
[2023-03-22 05:55:59] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 0 ms to minimize.
[2023-03-22 05:55:59] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2023-03-22 05:56:00] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2023-03-22 05:56:00] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-22 05:56:00] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-22 05:56:00] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2023-03-22 05:56:01] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2023-03-22 05:56:01] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-22 05:56:01] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-22 05:56:01] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-22 05:56:02] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-22 05:56:02] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-22 05:56:02] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-22 05:56:02] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-22 05:56:02] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2023-03-22 05:56:03] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 3 ms to minimize.
[2023-03-22 05:56:03] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 1 ms to minimize.
[2023-03-22 05:56:03] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2023-03-22 05:56:03] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2023-03-22 05:56:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6363 ms
[2023-03-22 05:56:03] [INFO ] After 7036ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:03] [INFO ] After 7382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 195 ms returned sat
[2023-03-22 05:56:05] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:05] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 1 ms to minimize.
[2023-03-22 05:56:05] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 0 ms to minimize.
[2023-03-22 05:56:06] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2023-03-22 05:56:06] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2023-03-22 05:56:06] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-22 05:56:07] [INFO ] Deduced a trap composed of 18 places in 435 ms of which 1 ms to minimize.
[2023-03-22 05:56:07] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 1 ms to minimize.
[2023-03-22 05:56:07] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-22 05:56:07] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 0 ms to minimize.
[2023-03-22 05:56:08] [INFO ] Deduced a trap composed of 17 places in 618 ms of which 0 ms to minimize.
[2023-03-22 05:56:08] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2023-03-22 05:56:09] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-22 05:56:09] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-22 05:56:09] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 10 ms to minimize.
[2023-03-22 05:56:09] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 1 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 1 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2023-03-22 05:56:10] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 13 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 12 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 2 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-22 05:56:11] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-22 05:56:12] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7733 ms
[2023-03-22 05:56:12] [INFO ] After 8532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-22 05:56:13] [INFO ] After 9080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 96 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 6650 steps, including 1 resets, run visited all 1 properties in 31 ms. (steps per millisecond=214 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 52 reset in 499 ms.
Product exploration explored 100000 steps with 46 reset in 538 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1280
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1280
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 756 place count 1341 transition count 1280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 757 place count 1341 transition count 1279
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 899 place count 1199 transition count 1137
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1041 place count 1199 transition count 1137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1199 transition count 1137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1197 transition count 1135
Deduced a syphon composed of 613 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1197 transition count 1135
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1125 place count 1197 transition count 1468
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1204 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1283 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Applied a total of 1283 rules in 334 ms. Remains 1118 /1341 variables (removed 223) and now considering 1310/1201 (removed -109) transitions.
[2023-03-22 05:56:15] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1310 rows 1118 cols
[2023-03-22 05:56:15] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-22 05:56:16] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1118/1341 places, 1310/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1112 ms. Remains : 1118/1341 places, 1310/1201 transitions.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 55 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-22 05:56:16] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-22 05:56:17] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-22 05:56:17] [INFO ] Invariant cache hit.
[2023-03-22 05:56:18] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2023-03-22 05:56:18] [INFO ] Invariant cache hit.
[2023-03-22 05:56:19] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2451 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 46298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1348 transition count 929
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1069 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 3 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 1 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1692 place count 501 transition count 420
Applied a total of 1692 rules in 280 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-22 05:56:19] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:56:19] [INFO ] Implicit Places using invariants in 397 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1349 places, 420/1209 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 497 transition count 418
Applied a total of 4 rules in 12 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:19] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:56:20] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-22 05:56:20] [INFO ] Invariant cache hit.
[2023-03-22 05:56:20] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1640 ms. Remains : 497/1349 places, 418/1209 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s347 1) (EQ s363 1)), p1:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 65 reset in 474 ms.
Product exploration explored 100000 steps with 69 reset in 586 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:56:22] [INFO ] Invariant cache hit.
[2023-03-22 05:56:22] [INFO ] [Real]Absence check using 218 positive place invariants in 48 ms returned sat
[2023-03-22 05:56:22] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:23] [INFO ] [Nat]Absence check using 218 positive place invariants in 95 ms returned sat
[2023-03-22 05:56:23] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:23] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-22 05:56:23] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 418
Applied a total of 1 rules in 15 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 497/497 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 494925 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494925 steps, saw 380135 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:26] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:56:26] [INFO ] [Real]Absence check using 218 positive place invariants in 43 ms returned sat
[2023-03-22 05:56:26] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:27] [INFO ] [Nat]Absence check using 218 positive place invariants in 63 ms returned sat
[2023-03-22 05:56:27] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:27] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-22 05:56:27] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 9 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 497/497 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-22 05:56:27] [INFO ] Invariant cache hit.
[2023-03-22 05:56:27] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-22 05:56:27] [INFO ] Invariant cache hit.
[2023-03-22 05:56:28] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-22 05:56:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:56:28] [INFO ] Invariant cache hit.
[2023-03-22 05:56:28] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1323 ms. Remains : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 497 transition count 418
Applied a total of 117 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:28] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-22 05:56:29] [INFO ] [Real]Absence check using 218 positive place invariants in 320 ms returned sat
[2023-03-22 05:56:29] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:29] [INFO ] [Nat]Absence check using 218 positive place invariants in 176 ms returned sat
[2023-03-22 05:56:29] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 05:56:29] [INFO ] After 18ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:30] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-22 05:56:30] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 419 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:30] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-22 05:56:31] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-22 05:56:31] [INFO ] Invariant cache hit.
[2023-03-22 05:56:31] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-22 05:56:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:56:31] [INFO ] Invariant cache hit.
[2023-03-22 05:56:32] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1350 ms. Remains : 497/497 places, 418/418 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:56:32] [INFO ] Invariant cache hit.
[2023-03-22 05:56:32] [INFO ] [Real]Absence check using 218 positive place invariants in 53 ms returned sat
[2023-03-22 05:56:32] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:33] [INFO ] [Nat]Absence check using 218 positive place invariants in 42 ms returned sat
[2023-03-22 05:56:33] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:33] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 05:56:33] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 418
Applied a total of 1 rules in 18 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 497/497 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 489152 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 489152 steps, saw 375710 distinct states, run finished after 3012 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:36] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:56:36] [INFO ] [Real]Absence check using 218 positive place invariants in 63 ms returned sat
[2023-03-22 05:56:36] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:37] [INFO ] [Nat]Absence check using 218 positive place invariants in 61 ms returned sat
[2023-03-22 05:56:37] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:37] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 05:56:37] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 497/497 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-22 05:56:37] [INFO ] Invariant cache hit.
[2023-03-22 05:56:38] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2023-03-22 05:56:38] [INFO ] Invariant cache hit.
[2023-03-22 05:56:38] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2023-03-22 05:56:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:56:38] [INFO ] Invariant cache hit.
[2023-03-22 05:56:39] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2000 ms. Remains : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 497 transition count 418
Applied a total of 117 rules in 15 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:39] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:56:39] [INFO ] [Real]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-22 05:56:40] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:56:40] [INFO ] [Nat]Absence check using 218 positive place invariants in 55 ms returned sat
[2023-03-22 05:56:40] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 05:56:40] [INFO ] After 40ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:56:40] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 05:56:40] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 433 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 69 reset in 574 ms.
Product exploration explored 100000 steps with 76 reset in 486 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:56:42] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:56:42] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-22 05:56:42] [INFO ] Invariant cache hit.
[2023-03-22 05:56:43] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-22 05:56:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:56:43] [INFO ] Invariant cache hit.
[2023-03-22 05:56:43] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 497/497 places, 418/418 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-12 finished in 24657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1))||(p2&&F(p3)))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 92 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-22 05:56:43] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-22 05:56:44] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-22 05:56:44] [INFO ] Invariant cache hit.
[2023-03-22 05:56:45] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2023-03-22 05:56:46] [INFO ] Invariant cache hit.
[2023-03-22 05:56:47] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3297 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s35 0), p0:(EQ s484 1), p2:(EQ s936 1), p1:(OR (EQ s52 0) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-13 finished in 3649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X((G(p2)&&F((p3&&X(p4)))))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 127 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-22 05:56:47] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-22 05:56:48] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-22 05:56:48] [INFO ] Invariant cache hit.
[2023-03-22 05:56:50] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2558 ms to find 0 implicit places.
[2023-03-22 05:56:50] [INFO ] Invariant cache hit.
[2023-03-22 05:56:51] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4303 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 609 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (NOT p2), (AND (NOT p1) (NOT p2)), true, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p4) (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p3 (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p4), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p4), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 p2 p4), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 8}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 p3), acceptance={0} source=6 dest: 0}, { cond=(NOT p2), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p2:(AND (EQ s970 1) (EQ s972 1)), p3:(EQ s870 0), p4:(EQ s207 0), p1:(EQ s870 1), p0:(EQ s1011 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-14 finished in 4945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ShieldPPPt-PT-020B-LTLFireability-09
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 560 place count 1068 transition count 773
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 2 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1566 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1569 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1685 place count 506 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1692 place count 501 transition count 419
Applied a total of 1692 rules in 212 ms. Remains 501 /1349 variables (removed 848) and now considering 419/1209 (removed 790) transitions.
// Phase 1: matrix 419 rows 501 cols
[2023-03-22 05:56:52] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-22 05:56:53] [INFO ] Implicit Places using invariants in 314 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 315 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 419/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 417
Applied a total of 4 rules in 15 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2023-03-22 05:56:53] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:56:53] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-22 05:56:53] [INFO ] Invariant cache hit.
[2023-03-22 05:56:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:56:54] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 417/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1796 ms. Remains : 497/1349 places, 417/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s430 1) (NEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 427 ms.
Product exploration explored 100000 steps with 0 reset in 475 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished Best-First random walk after 225 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 10 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-22 05:56:56] [INFO ] Invariant cache hit.
[2023-03-22 05:56:56] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-22 05:56:56] [INFO ] Invariant cache hit.
[2023-03-22 05:56:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:56:57] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-22 05:56:57] [INFO ] Invariant cache hit.
[2023-03-22 05:56:57] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 ms. Remains : 497/497 places, 417/417 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 494 ms.
Product exploration explored 100000 steps with 0 reset in 526 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 17 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-22 05:56:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 05:56:59] [INFO ] Invariant cache hit.
[2023-03-22 05:57:00] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 497/497 places, 417/417 transitions.
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 18 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-22 05:57:00] [INFO ] Invariant cache hit.
[2023-03-22 05:57:00] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-22 05:57:00] [INFO ] Invariant cache hit.
[2023-03-22 05:57:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:57:00] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-22 05:57:00] [INFO ] Invariant cache hit.
[2023-03-22 05:57:01] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 497/497 places, 417/417 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 8836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-020B-LTLFireability-11
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 2 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1692 place count 501 transition count 420
Applied a total of 1692 rules in 164 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-22 05:57:01] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-22 05:57:02] [INFO ] Implicit Places using invariants in 387 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 388 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 420/1209 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 497 transition count 418
Applied a total of 4 rules in 17 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-22 05:57:02] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:57:02] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-22 05:57:02] [INFO ] Invariant cache hit.
[2023-03-22 05:57:02] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1362 ms. Remains : 497/1349 places, 418/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s383 1) (EQ s399 1)), p1:(AND (EQ s220 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 198 reset in 420 ms.
Stack based approach found an accepted trace after 93044 steps with 174 reset with depth 83 and stack size 83 in 486 ms.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 2650 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2023-03-22 05:57:04] [INFO ] Flatten gal took : 59 ms
[2023-03-22 05:57:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 05:57:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1349 places, 1209 transitions and 3138 arcs took 19 ms.
Total runtime 210805 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2623/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2623/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2623/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLFireability-11
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLFireability-12

BK_STOP 1679464625962

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-020B-LTLFireability-09
ltl formula formula --ltl=/tmp/2623/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1349 places, 1209 transitions and 3138 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2623/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2623/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2623/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.090 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2623/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-020B-LTLFireability-11
ltl formula formula --ltl=/tmp/2623/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1349 places, 1209 transitions and 3138 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.050 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2623/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2623/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2623/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2623/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-020B-LTLFireability-12
ltl formula formula --ltl=/tmp/2623/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1349 places, 1209 transitions and 3138 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.050 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2623/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2623/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2623/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2623/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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