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-167903717300635.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300635
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679464231400

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=LTLCardinality
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:50:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:50:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:50:35] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-22 05:50:35] [INFO ] Transformed 1563 places.
[2023-03-22 05:50:35] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:50:35] [INFO ] Found NUPN structural information;
[2023-03-22 05:50:35] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 627 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2023-03-22 05:50:36] [INFO ] Computed 221 place invariants in 26 ms
[2023-03-22 05:50:37] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-22 05:50:37] [INFO ] Invariant cache hit.
[2023-03-22 05:50:39] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3181 ms to find 0 implicit places.
[2023-03-22 05:50:39] [INFO ] Invariant cache hit.
[2023-03-22 05:50:40] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1563 places, 1205/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4969 ms. Remains : 1345/1563 places, 1205/1423 transitions.
Support contains 23 out of 1345 places after structural reductions.
[2023-03-22 05:50:40] [INFO ] Flatten gal took : 127 ms
[2023-03-22 05:50:40] [INFO ] Flatten gal took : 48 ms
[2023-03-22 05:50:41] [INFO ] Input system was already deterministic with 1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 05:50:41] [INFO ] Invariant cache hit.
[2023-03-22 05:50:42] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 05:50:42] [INFO ] [Nat]Absence check using 221 positive place invariants in 136 ms returned sat
[2023-03-22 05:50:44] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 05:50:44] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 22 ms to minimize.
[2023-03-22 05:50:45] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 2 ms to minimize.
[2023-03-22 05:50:45] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 2 ms to minimize.
[2023-03-22 05:50:45] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-22 05:50:46] [INFO ] Deduced a trap composed of 25 places in 442 ms of which 14 ms to minimize.
[2023-03-22 05:50:46] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2023-03-22 05:50:47] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 14 ms to minimize.
[2023-03-22 05:50:47] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 0 ms to minimize.
[2023-03-22 05:50:47] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-22 05:50:47] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2023-03-22 05:50:48] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 1 ms to minimize.
[2023-03-22 05:50:48] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 1 ms to minimize.
[2023-03-22 05:50:48] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2023-03-22 05:50:48] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2023-03-22 05:50:49] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-22 05:50:49] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 0 ms to minimize.
[2023-03-22 05:50:49] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2023-03-22 05:50:50] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2023-03-22 05:50:50] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2023-03-22 05:50:50] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2023-03-22 05:50:50] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2023-03-22 05:50:50] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
[2023-03-22 05:50:51] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-22 05:50:51] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-22 05:50:51] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 0 ms to minimize.
[2023-03-22 05:50:51] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2023-03-22 05:50:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2023-03-22 05:50:52] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7536 ms
[2023-03-22 05:50:52] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2023-03-22 05:50:52] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2023-03-22 05:50:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-22 05:50:53] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-22 05:50:53] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2023-03-22 05:50:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-22 05:50:53] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-22 05:50:54] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2023-03-22 05:50:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2023-03-22 05:50:54] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 13 ms to minimize.
[2023-03-22 05:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-22 05:50:54] [INFO ] After 11347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-03-22 05:50:55] [INFO ] After 12868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 445 ms.
Support contains 14 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 1345 transition count 931
Reduce places removed 274 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 275 rules applied. Total rules applied 549 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 550 place count 1070 transition count 930
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 550 place count 1070 transition count 775
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 860 place count 915 transition count 775
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 861 place count 914 transition count 774
Iterating global reduction 3 with 1 rules applied. Total rules applied 862 place count 914 transition count 774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 862 place count 914 transition count 773
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 913 transition count 773
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 3 with 678 rules applied. Total rules applied 1542 place count 574 transition count 434
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 574 transition count 433
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 573 transition count 432
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1653 place count 519 transition count 432
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1654 place count 519 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1655 place count 518 transition count 431
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1713 place count 518 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1714 place count 517 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1715 place count 516 transition count 430
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1715 place count 516 transition count 428
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1719 place count 514 transition count 428
Applied a total of 1719 rules in 443 ms. Remains 514 /1345 variables (removed 831) and now considering 428/1205 (removed 777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 514/1345 places, 428/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 428 rows 514 cols
[2023-03-22 05:50:56] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-22 05:50:56] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:50:56] [INFO ] [Nat]Absence check using 220 positive place invariants in 60 ms returned sat
[2023-03-22 05:50:57] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:50:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:50:57] [INFO ] After 240ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:50:57] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-22 05:50:57] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 105 ms.
Support contains 12 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 428/428 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 514 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 513 transition count 427
Applied a total of 2 rules in 53 ms. Remains 513 /514 variables (removed 1) and now considering 427/428 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 513/514 places, 427/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 117679 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117679 steps, saw 93289 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 427 rows 513 cols
[2023-03-22 05:51:01] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:51:02] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:51:02] [INFO ] [Nat]Absence check using 220 positive place invariants in 64 ms returned sat
[2023-03-22 05:51:02] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:51:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:03] [INFO ] After 211ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:51:03] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-22 05:51:03] [INFO ] After 1849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 70 ms.
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 427/427 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 513/513 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 427/427 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-22 05:51:03] [INFO ] Invariant cache hit.
[2023-03-22 05:51:04] [INFO ] Implicit Places using invariants in 228 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 231 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 427/427 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 425
Applied a total of 4 rules in 14 ms. Remains 509 /511 variables (removed 2) and now considering 425/427 (removed 2) transitions.
// Phase 1: matrix 425 rows 509 cols
[2023-03-22 05:51:04] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:04] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-22 05:51:04] [INFO ] Invariant cache hit.
[2023-03-22 05:51:05] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 425/427 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1642 ms. Remains : 509/513 places, 425/427 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 157008 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157008 steps, saw 128058 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 05:51:09] [INFO ] Invariant cache hit.
[2023-03-22 05:51:09] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:51:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 23 ms returned sat
[2023-03-22 05:51:10] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-22 05:51:10] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-22 05:51:10] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 31 ms.
Support contains 12 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 425/425 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 509/509 places, 425/425 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 425/425 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2023-03-22 05:51:10] [INFO ] Invariant cache hit.
[2023-03-22 05:51:11] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-22 05:51:11] [INFO ] Invariant cache hit.
[2023-03-22 05:51:12] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-03-22 05:51:12] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 05:51:12] [INFO ] Invariant cache hit.
[2023-03-22 05:51:12] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1653 ms. Remains : 509/509 places, 425/425 transitions.
Partial Free-agglomeration rule applied 103 times.
Drop transitions removed 103 transitions
Iterating global reduction 0 with 103 rules applied. Total rules applied 103 place count 509 transition count 425
Applied a total of 103 rules in 30 ms. Remains 509 /509 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 425 rows 509 cols
[2023-03-22 05:51:12] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:12] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:51:12] [INFO ] [Nat]Absence check using 218 positive place invariants in 69 ms returned sat
[2023-03-22 05:51:13] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:51:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 05:51:13] [INFO ] After 242ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 24 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 483 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-22 05:51:14] [INFO ] After 1260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-22 05:51:14] [INFO ] After 2206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 319 stabilizing places and 319 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' '!(G(F(p0)))'
Support contains 1 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 560 place count 1064 transition count 765
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 878 place count 905 transition count 765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 881 place count 902 transition count 762
Iterating global reduction 2 with 3 rules applied. Total rules applied 884 place count 902 transition count 762
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 884 place count 902 transition count 760
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 888 place count 900 transition count 760
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 1562 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 1563 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 1565 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 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1690 place count 498 transition count 417
Applied a total of 1690 rules in 285 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-22 05:51:15] [INFO ] Computed 220 place invariants in 15 ms
[2023-03-22 05:51:16] [INFO ] Implicit Places using invariants in 1035 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1058 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 17 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-22 05:51:16] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:16] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-22 05:51:16] [INFO ] Invariant cache hit.
[2023-03-22 05:51:17] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2182 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-01 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 s435 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 258 reset in 576 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-01 finished in 3192 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(G((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 926
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 1066 transition count 925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 558 place count 1065 transition count 769
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 870 place count 909 transition count 769
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 872 place count 907 transition count 767
Iterating global reduction 3 with 2 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 874 place count 907 transition count 766
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 876 place count 906 transition count 766
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 1550 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1551 place count 569 transition count 428
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 1553 place count 568 transition count 427
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 1667 place count 511 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1670 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1670 place count 508 transition count 423
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 1674 place count 506 transition count 423
Applied a total of 1674 rules in 223 ms. Remains 506 /1345 variables (removed 839) and now considering 423/1205 (removed 782) transitions.
// Phase 1: matrix 423 rows 506 cols
[2023-03-22 05:51:18] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:51:19] [INFO ] Implicit Places using invariants in 557 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 581 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1345 places, 423/1205 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 502 transition count 421
Applied a total of 4 rules in 14 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:19] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:20] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-22 05:51:20] [INFO ] Invariant cache hit.
[2023-03-22 05:51:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:20] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/1345 places, 421/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2375 ms. Remains : 502/1345 places, 421/1205 transitions.
Stuttering acceptance computed with spot in 505 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s223 0) (EQ s435 1)), p2:(EQ s125 1), p1:(OR (EQ s22 0) (EQ s258 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 492 ms.
Product exploration explored 100000 steps with 0 reset in 679 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 874 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 05:51:24] [INFO ] Invariant cache hit.
[2023-03-22 05:51:24] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:24] [INFO ] [Nat]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-22 05:51:24] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:25] [INFO ] After 154ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:25] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-22 05:51:25] [INFO ] After 1080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 165895 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165895 steps, saw 119812 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:28] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:51:29] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:29] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2023-03-22 05:51:29] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:29] [INFO ] After 78ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:29] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-22 05:51:29] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-22 05:51:29] [INFO ] Invariant cache hit.
[2023-03-22 05:51:30] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-22 05:51:30] [INFO ] Invariant cache hit.
[2023-03-22 05:51:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:30] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2023-03-22 05:51:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:51:30] [INFO ] Invariant cache hit.
[2023-03-22 05:51:31] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1212 ms. Remains : 502/502 places, 421/421 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 502 transition count 421
Applied a total of 113 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:31] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:31] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:31] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2023-03-22 05:51:31] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:51:31] [INFO ] After 147ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:32] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-22 05:51:32] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 836 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 453 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 461 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 13 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:34] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:34] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-22 05:51:34] [INFO ] Invariant cache hit.
[2023-03-22 05:51:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:35] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-22 05:51:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:51:35] [INFO ] Invariant cache hit.
[2023-03-22 05:51:35] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1160 ms. Remains : 502/502 places, 421/421 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 506 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 05:51:36] [INFO ] Invariant cache hit.
[2023-03-22 05:51:36] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:37] [INFO ] [Nat]Absence check using 218 positive place invariants in 61 ms returned sat
[2023-03-22 05:51:37] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:37] [INFO ] After 154ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:37] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-22 05:51:38] [INFO ] After 1273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 153155 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153155 steps, saw 110735 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:41] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:41] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using 218 positive place invariants in 55 ms returned sat
[2023-03-22 05:51:42] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:42] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:42] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-22 05:51:42] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 110 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 11 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-22 05:51:42] [INFO ] Invariant cache hit.
[2023-03-22 05:51:43] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-22 05:51:43] [INFO ] Invariant cache hit.
[2023-03-22 05:51:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:43] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2023-03-22 05:51:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:51:43] [INFO ] Invariant cache hit.
[2023-03-22 05:51:44] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1252 ms. Remains : 502/502 places, 421/421 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 502 transition count 421
Applied a total of 113 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:44] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:44] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:51:44] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-22 05:51:44] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:51:45] [INFO ] After 97ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 05:51:45] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:45] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-22 05:51:45] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-22 05:51:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2023-03-22 05:51:45] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-22 05:51:45] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-22 05:51:45] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 687 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 508 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 433 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 598 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:48] [INFO ] Computed 218 place invariants in 15 ms
[2023-03-22 05:51:49] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-22 05:51:49] [INFO ] Invariant cache hit.
[2023-03-22 05:51:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:49] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2023-03-22 05:51:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 05:51:49] [INFO ] Invariant cache hit.
[2023-03-22 05:51:50] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1331 ms. Remains : 502/502 places, 421/421 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-02 finished in 31956 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)&&F(p1))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 925
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 558 place count 1065 transition count 767
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 874 place count 907 transition count 767
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 876 place count 905 transition count 765
Iterating global reduction 2 with 2 rules applied. Total rules applied 878 place count 905 transition count 765
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 878 place count 905 transition count 763
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 882 place count 903 transition count 763
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 1554 place count 567 transition count 427
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 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 566 transition count 425
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1675 place count 507 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1677 place count 505 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1678 place count 504 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1678 place count 504 transition count 421
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 1682 place count 502 transition count 421
Applied a total of 1682 rules in 128 ms. Remains 502 /1345 variables (removed 843) and now considering 421/1205 (removed 784) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-22 05:51:50] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:51:50] [INFO ] Implicit Places using invariants in 232 ms returned [485, 489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1345 places, 421/1205 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 498 transition count 419
Applied a total of 4 rules in 15 ms. Remains 498 /500 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-22 05:51:50] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:51:51] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-22 05:51:51] [INFO ] Invariant cache hit.
[2023-03-22 05:51:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:51] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 498/1345 places, 419/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1312 ms. Remains : 498/1345 places, 419/1205 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s52 0) (EQ s334 1)), p1:(OR (EQ s56 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5 reset in 450 ms.
Product exploration explored 100000 steps with 1 reset in 565 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 348 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:51:53] [INFO ] Invariant cache hit.
[2023-03-22 05:51:53] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:51:53] [INFO ] [Nat]Absence check using 218 positive place invariants in 44 ms returned sat
[2023-03-22 05:51:53] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:51:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:53] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:51:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-22 05:51:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-22 05:51:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-22 05:51:54] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 05:51:54] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 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 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 28 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 495/498 places, 416/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 490188 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 490188 steps, saw 364807 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-22 05:51:57] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:57] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:51:57] [INFO ] [Nat]Absence check using 218 positive place invariants in 38 ms returned sat
[2023-03-22 05:51:57] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:51:57] [INFO ] After 293ms 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:51:57] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-22 05:51:57] [INFO ] Invariant cache hit.
[2023-03-22 05:51:58] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-22 05:51:58] [INFO ] Invariant cache hit.
[2023-03-22 05:51:58] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2023-03-22 05:51:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:51:58] [INFO ] Invariant cache hit.
[2023-03-22 05:51:59] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 495 transition count 416
Applied a total of 116 rules in 17 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-22 05:51:59] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:51:59] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using 218 positive place invariants in 56 ms returned sat
[2023-03-22 05:51:59] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:51:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:51:59] [INFO ] After 45ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:51:59] [INFO ] After 110ms 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:51:59] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 419/419 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-22 05:52:00] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-22 05:52:00] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-22 05:52:00] [INFO ] Invariant cache hit.
[2023-03-22 05:52:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:01] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-22 05:52:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:52:01] [INFO ] Invariant cache hit.
[2023-03-22 05:52:01] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1157 ms. Remains : 498/498 places, 419/419 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:52:01] [INFO ] Invariant cache hit.
[2023-03-22 05:52:01] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:52:02] [INFO ] [Nat]Absence check using 218 positive place invariants in 26 ms returned sat
[2023-03-22 05:52:02] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:52:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:02] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:52:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-22 05:52:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-22 05:52:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-22 05:52:02] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-22 05:52:02] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 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 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 32 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 495/498 places, 416/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 505893 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505893 steps, saw 376419 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-22 05:52:05] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:52:05] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:52:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 49 ms returned sat
[2023-03-22 05:52:06] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:52:06] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 05:52:06] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-22 05:52:06] [INFO ] Invariant cache hit.
[2023-03-22 05:52:06] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-22 05:52:06] [INFO ] Invariant cache hit.
[2023-03-22 05:52:07] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-22 05:52:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:52:07] [INFO ] Invariant cache hit.
[2023-03-22 05:52:07] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1247 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 495 transition count 416
Applied a total of 116 rules in 13 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-22 05:52:07] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:52:07] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:52:07] [INFO ] [Nat]Absence check using 218 positive place invariants in 102 ms returned sat
[2023-03-22 05:52:08] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:52:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:08] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:52:08] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 05:52:08] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 392 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 514 ms.
Product exploration explored 100000 steps with 1 reset in 639 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 498 /498 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-22 05:52:10] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:52:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-22 05:52:10] [INFO ] Invariant cache hit.
[2023-03-22 05:52:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:11] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2023-03-22 05:52:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:52:11] [INFO ] Invariant cache hit.
[2023-03-22 05:52:11] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1252 ms. Remains : 498/498 places, 419/419 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-03 finished in 21268 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 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
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 886 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1562 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 1563 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1565 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 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1690 place count 498 transition count 417
Applied a total of 1690 rules in 141 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-22 05:52:11] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:52:12] [INFO ] Implicit Places using invariants in 343 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 344 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 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 494 transition count 415
Applied a total of 4 rules in 12 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-22 05:52:12] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-22 05:52:12] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-22 05:52:12] [INFO ] Invariant cache hit.
[2023-03-22 05:52:13] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1572 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s380 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 195 reset in 452 ms.
Stack based approach found an accepted trace after 19891 steps with 41 reset with depth 44 and stack size 43 in 127 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-06 finished in 2264 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&&X(p1))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1342 transition count 1202
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1342 transition count 1202
Applied a total of 6 rules in 115 ms. Remains 1342 /1345 variables (removed 3) and now considering 1202/1205 (removed 3) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-22 05:52:13] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-22 05:52:14] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-22 05:52:14] [INFO ] Invariant cache hit.
[2023-03-22 05:52:16] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2023-03-22 05:52:16] [INFO ] Invariant cache hit.
[2023-03-22 05:52:16] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1345 places, 1202/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3020 ms. Remains : 1342/1345 places, 1202/1205 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s442 0) (EQ s283 1)), p1:(OR (EQ s525 0) (EQ s1241 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]]
Entered a terminal (fully accepting) state of product in 391 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-09 finished in 3216 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((G(p2)||p1)))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1343 transition count 1203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1343 transition count 1203
Applied a total of 4 rules in 76 ms. Remains 1343 /1345 variables (removed 2) and now considering 1203/1205 (removed 2) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2023-03-22 05:52:17] [INFO ] Computed 221 place invariants in 9 ms
[2023-03-22 05:52:17] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-22 05:52:17] [INFO ] Invariant cache hit.
[2023-03-22 05:52:18] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2023-03-22 05:52:18] [INFO ] Invariant cache hit.
[2023-03-22 05:52:19] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1345 places, 1203/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2801 ms. Remains : 1343/1345 places, 1203/1205 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(OR (EQ s66 0) (EQ s903 1)), p1:(OR (EQ s649 0) (EQ s1074 1)), p0:(OR (EQ s649 0) (EQ s1074 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]]
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 633 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 p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 505 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:52:22] [INFO ] Invariant cache hit.
[2023-03-22 05:52:22] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:52:22] [INFO ] [Nat]Absence check using 221 positive place invariants in 81 ms returned sat
[2023-03-22 05:52:23] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:52:24] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 0 ms to minimize.
[2023-03-22 05:52:24] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 18 ms to minimize.
[2023-03-22 05:52:24] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 19 ms to minimize.
[2023-03-22 05:52:25] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 1 ms to minimize.
[2023-03-22 05:52:25] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-22 05:52:25] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2023-03-22 05:52:25] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 1 ms to minimize.
[2023-03-22 05:52:26] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2023-03-22 05:52:26] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 1 ms to minimize.
[2023-03-22 05:52:26] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 13 ms to minimize.
[2023-03-22 05:52:26] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 0 ms to minimize.
[2023-03-22 05:52:27] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 2 ms to minimize.
[2023-03-22 05:52:27] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-22 05:52:27] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2023-03-22 05:52:27] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2023-03-22 05:52:28] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2023-03-22 05:52:28] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 0 ms to minimize.
[2023-03-22 05:52:28] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 0 ms to minimize.
[2023-03-22 05:52:28] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-22 05:52:28] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 1 ms to minimize.
[2023-03-22 05:52:29] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-22 05:52:29] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-22 05:52:29] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 0 ms to minimize.
[2023-03-22 05:52:29] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 0 ms to minimize.
[2023-03-22 05:52:30] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 0 ms to minimize.
[2023-03-22 05:52:30] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-22 05:52:30] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2023-03-22 05:52:30] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 0 ms to minimize.
[2023-03-22 05:52:30] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6916 ms
[2023-03-22 05:52:30] [INFO ] After 7948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-22 05:52:31] [INFO ] After 8467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 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 1343 transition count 924
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 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 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 4 with 2 rules applied. Total rules applied 1561 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 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 134 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished probabilistic random walk after 225741 steps, run visited all 2 properties in 2473 ms. (steps per millisecond=91 )
Probabilistic random walk after 225741 steps, saw 170910 distinct states, run finished after 2474 ms. (steps per millisecond=91 ) properties seen :2
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 499 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Applied a total of 0 rules in 49 ms. Remains 1343 /1343 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-22 05:52:34] [INFO ] Invariant cache hit.
[2023-03-22 05:52:35] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-22 05:52:35] [INFO ] Invariant cache hit.
[2023-03-22 05:52:36] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-03-22 05:52:36] [INFO ] Invariant cache hit.
[2023-03-22 05:52:37] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2866 ms. Remains : 1343/1343 places, 1203/1203 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 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 564 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 117465 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117465 steps, saw 75497 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
[2023-03-22 05:52:41] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 05:52:42] [INFO ] [Nat]Absence check using 221 positive place invariants in 128 ms returned sat
[2023-03-22 05:52:43] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 05:52:43] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2023-03-22 05:52:43] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-22 05:52:44] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 1 ms to minimize.
[2023-03-22 05:52:44] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 0 ms to minimize.
[2023-03-22 05:52:45] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-22 05:52:45] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 1 ms to minimize.
[2023-03-22 05:52:45] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 0 ms to minimize.
[2023-03-22 05:52:45] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 1 ms to minimize.
[2023-03-22 05:52:46] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 0 ms to minimize.
[2023-03-22 05:52:46] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 0 ms to minimize.
[2023-03-22 05:52:47] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 1 ms to minimize.
[2023-03-22 05:52:47] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 1 ms to minimize.
[2023-03-22 05:52:47] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2023-03-22 05:52:48] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 1 ms to minimize.
[2023-03-22 05:52:48] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 1 ms to minimize.
[2023-03-22 05:52:48] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2023-03-22 05:52:48] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 1 ms to minimize.
[2023-03-22 05:52:49] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 0 ms to minimize.
[2023-03-22 05:52:49] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2023-03-22 05:52:49] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 0 ms to minimize.
[2023-03-22 05:52:50] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
[2023-03-22 05:52:50] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-22 05:52:50] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2023-03-22 05:52:50] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 1 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 0 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 15 ms to minimize.
[2023-03-22 05:52:52] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 0 ms to minimize.
[2023-03-22 05:52:52] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2023-03-22 05:52:52] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2023-03-22 05:52:52] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9197 ms
[2023-03-22 05:52:52] [INFO ] After 10325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-22 05:52:53] [INFO ] After 11097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 138 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 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 1343 transition count 924
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 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 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 4 with 2 rules applied. Total rules applied 1561 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 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 196 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 500 cols
[2023-03-22 05:52:53] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:52:53] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:52:54] [INFO ] [Nat]Absence check using 220 positive place invariants in 59 ms returned sat
[2023-03-22 05:52:54] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:54] [INFO ] After 74ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:52:54] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-22 05:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-22 05:52:54] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-22 05:52:54] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 500/500 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 210332 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210332 steps, saw 158307 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:58] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:52:58] [INFO ] [Nat]Absence check using 220 positive place invariants in 69 ms returned sat
[2023-03-22 05:52:58] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:52:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 05:52:58] [INFO ] After 67ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:52:58] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-22 05:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-22 05:52:58] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-22 05:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-22 05:52:58] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 05:52:58] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 500/500 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
[2023-03-22 05:52:59] [INFO ] Implicit Places using invariants in 450 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/500 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 496 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 496 transition count 416
Applied a total of 4 rules in 11 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2023-03-22 05:52:59] [INFO ] Computed 218 place invariants in 0 ms
[2023-03-22 05:52:59] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-22 05:52:59] [INFO ] Invariant cache hit.
[2023-03-22 05:53:00] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 496/500 places, 416/418 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1606 ms. Remains : 496/500 places, 416/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 258106 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258106 steps, saw 207500 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:53:03] [INFO ] Invariant cache hit.
[2023-03-22 05:53:03] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:53:03] [INFO ] [Nat]Absence check using 218 positive place invariants in 50 ms returned sat
[2023-03-22 05:53:04] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:53:04] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 05:53:04] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 416/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 496/496 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-22 05:53:04] [INFO ] Invariant cache hit.
[2023-03-22 05:53:04] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-22 05:53:04] [INFO ] Invariant cache hit.
[2023-03-22 05:53:05] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-03-22 05:53:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:53:05] [INFO ] Invariant cache hit.
[2023-03-22 05:53:05] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 ms. Remains : 496/496 places, 416/416 transitions.
Partial Free-agglomeration rule applied 112 times.
Drop transitions removed 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 496 transition count 416
Applied a total of 112 rules in 26 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 416 rows 496 cols
[2023-03-22 05:53:05] [INFO ] Computed 218 place invariants in 0 ms
[2023-03-22 05:53:05] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:53:05] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2023-03-22 05:53:06] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:53:06] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-22 05:53:06] [INFO ] After 103ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:53:06] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-22 05:53:06] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 567 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 415 ms.
Entered a terminal (fully accepting) state of product in 31086 steps with 0 reset in 161 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 51209 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))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 886 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 1560 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 1561 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 1563 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 1679 place count 505 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1681 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1682 place count 502 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 1682 place count 502 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 1686 place count 500 transition count 418
Applied a total of 1686 rules in 107 ms. Remains 500 /1345 variables (removed 845) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 500 cols
[2023-03-22 05:53:08] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:53:08] [INFO ] Implicit Places using invariants in 421 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1345 places, 418/1205 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 496 transition count 416
Applied a total of 4 rules in 11 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2023-03-22 05:53:08] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:53:09] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-22 05:53:09] [INFO ] Invariant cache hit.
[2023-03-22 05:53:09] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1464 ms. Remains : 496/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s277 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 428 ms.
Stack based approach found an accepted trace after 166 steps with 0 reset with depth 167 and stack size 167 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-11 finished in 1973 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(G(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
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 886 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 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1560 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 1561 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 1563 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 1681 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 1683 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 1684 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 1684 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 1688 place count 499 transition count 418
Applied a total of 1688 rules in 114 ms. Remains 499 /1345 variables (removed 846) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-22 05:53:10] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:53:10] [INFO ] Implicit Places using invariants in 309 ms returned [482, 486]
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 : 497/1345 places, 418/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 12 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:53:10] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:53:10] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-22 05:53:10] [INFO ] Invariant cache hit.
[2023-03-22 05:53:11] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1405 ms. Remains : 495/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s22 0) (NEQ s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-15 finished in 1903 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(G((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
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)&&F(p1))))'
[2023-03-22 05:53:12] [INFO ] Flatten gal took : 62 ms
[2023-03-22 05:53:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 05:53:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1345 places, 1205 transitions and 3130 arcs took 6 ms.
Total runtime 157618 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2074/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2074/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLCardinality-02
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLCardinality-03

BK_STOP 1679464393788

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-020B-LTLCardinality-02
ltl formula formula --ltl=/tmp/2074/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 1345 places, 1205 transitions and 3130 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.180 real 0.040 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2074/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2074/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2074/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2074/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-020B-LTLCardinality-03
ltl formula formula --ltl=/tmp/2074/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: =============================================================================
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 1345 places, 1205 transitions and 3130 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.180 real 0.090 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2074/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2074/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2074/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2074/ltl_1_
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)

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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300635"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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