Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978200444.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679317362588

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:02:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:02:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:02:44] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-20 13:02:44] [INFO ] Transformed 1295 places.
[2023-03-20 13:02:44] [INFO ] Transformed 749 transitions.
[2023-03-20 13:02:44] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 297 place count 202 transition count 433
Iterating global reduction 1 with 40 rules applied. Total rules applied 337 place count 202 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 343 place count 202 transition count 427
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 365 place count 180 transition count 405
Iterating global reduction 2 with 22 rules applied. Total rules applied 387 place count 180 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 393 place count 180 transition count 399
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 409 place count 164 transition count 381
Iterating global reduction 3 with 16 rules applied. Total rules applied 425 place count 164 transition count 381
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 491 place count 164 transition count 315
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 492 place count 163 transition count 314
Iterating global reduction 4 with 1 rules applied. Total rules applied 493 place count 163 transition count 314
Applied a total of 493 rules in 58 ms. Remains 163 /259 variables (removed 96) and now considering 314/749 (removed 435) transitions.
// Phase 1: matrix 314 rows 163 cols
[2023-03-20 13:02:44] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-20 13:02:45] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-20 13:02:45] [INFO ] Invariant cache hit.
[2023-03-20 13:02:45] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-20 13:02:45] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-20 13:02:45] [INFO ] Invariant cache hit.
[2023-03-20 13:02:45] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/259 places, 314/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 163/259 places, 314/749 transitions.
Support contains 31 out of 163 places after structural reductions.
[2023-03-20 13:02:45] [INFO ] Flatten gal took : 45 ms
[2023-03-20 13:02:46] [INFO ] Flatten gal took : 21 ms
[2023-03-20 13:02:46] [INFO ] Input system was already deterministic with 314 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-20 13:02:46] [INFO ] Invariant cache hit.
[2023-03-20 13:02:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:02:47] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:02:48] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2023-03-20 13:02:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:02:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:02:49] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2023-03-20 13:02:49] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-20 13:02:51] [INFO ] After 1686ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :1 sat :26
[2023-03-20 13:02:51] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 20 ms to minimize.
[2023-03-20 13:02:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-20 13:02:51] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2023-03-20 13:02:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-20 13:02:54] [INFO ] After 4706ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :25
Attempting to minimize the solution found.
Minimization took 2028 ms.
[2023-03-20 13:02:56] [INFO ] After 7997ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :25
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 3 properties in 979 ms.
Support contains 21 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 314/314 transitions.
Graph (complete) has 566 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 162 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 156 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 156 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 152 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 152 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 152 transition count 291
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 149 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 149 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 149 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 147 transition count 283
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 147 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 146 transition count 282
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 146 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 145 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 145 transition count 280
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 144 transition count 279
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 144 transition count 279
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 143 transition count 278
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 143 transition count 278
Applied a total of 43 rules in 87 ms. Remains 143 /163 variables (removed 20) and now considering 278/314 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 143/163 places, 278/314 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 279429 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{2=1, 3=1, 4=1, 6=1, 9=1, 10=1, 11=1, 15=1, 16=1, 18=1, 19=1, 20=1, 21=1}
Probabilistic random walk after 279429 steps, saw 130202 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :13
Running SMT prover for 9 properties.
// Phase 1: matrix 278 rows 143 cols
[2023-03-20 13:03:00] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 13:03:01] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-20 13:03:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:01] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 13:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:02] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 13:03:02] [INFO ] State equation strengthened by 180 read => feed constraints.
[2023-03-20 13:03:02] [INFO ] After 418ms SMT Verify possible using 180 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 13:03:03] [INFO ] After 1021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 788 ms.
[2023-03-20 13:03:04] [INFO ] After 2182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 135 ms.
Support contains 9 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 278/278 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 195
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 132 transition count 193
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 122 transition count 181
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 122 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 122 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 118 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 118 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 118 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 116 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 116 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 114 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 114 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 112 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 112 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 75 place count 112 transition count 160
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 111 transition count 159
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 111 transition count 159
Applied a total of 77 rules in 45 ms. Remains 111 /143 variables (removed 32) and now considering 159/278 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 111/143 places, 159/278 transitions.
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 414617 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 414617 steps, saw 179699 distinct states, run finished after 3003 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 159 rows 111 cols
[2023-03-20 13:03:07] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 13:03:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:08] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 13:03:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:08] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 13:03:08] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-20 13:03:08] [INFO ] After 198ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 13:03:08] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-20 13:03:09] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 70 ms.
Support contains 9 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 159/159 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 111/111 places, 159/159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 159/159 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2023-03-20 13:03:09] [INFO ] Invariant cache hit.
[2023-03-20 13:03:09] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-20 13:03:09] [INFO ] Invariant cache hit.
[2023-03-20 13:03:09] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-20 13:03:09] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-20 13:03:09] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 13:03:09] [INFO ] Invariant cache hit.
[2023-03-20 13:03:09] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 581 ms. Remains : 111/111 places, 159/159 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 111 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 107 transition count 154
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 9 place count 107 transition count 140
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 93 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 83 transition count 130
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 83 transition count 130
Applied a total of 59 rules in 29 ms. Remains 83 /111 variables (removed 28) and now considering 130/159 (removed 29) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 130 rows 83 cols
[2023-03-20 13:03:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:03:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:10] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 13:03:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:10] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 13:03:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2023-03-20 13:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-20 13:03:10] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2023-03-20 13:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-20 13:03:10] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-20 13:03:10] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 44 stabilizing places and 74 stable transitions
Graph (complete) has 628 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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(F((G(F((p1||G(p2))))&&p0))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 141 transition count 182
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 121 transition count 158
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 121 transition count 158
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 96 place count 121 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 109 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 109 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 109 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 104 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 98 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 98 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 98 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 96 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 96 transition count 114
Applied a total of 153 rules in 50 ms. Remains 96 /163 variables (removed 67) and now considering 114/314 (removed 200) transitions.
// Phase 1: matrix 114 rows 96 cols
[2023-03-20 13:03:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:03:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-20 13:03:11] [INFO ] Invariant cache hit.
[2023-03-20 13:03:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 13:03:11] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-20 13:03:11] [INFO ] Invariant cache hit.
[2023-03-20 13:03:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/163 places, 114/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 96/163 places, 114/314 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(!p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 155
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 146
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 138 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 94 transition count 111
Applied a total of 156 rules in 14 ms. Remains 94 /163 variables (removed 69) and now considering 111/314 (removed 203) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-20 13:03:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:12] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-20 13:03:12] [INFO ] Invariant cache hit.
[2023-03-20 13:03:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:12] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-20 13:03:12] [INFO ] Invariant cache hit.
[2023-03-20 13:03:12] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/163 places, 111/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 94/163 places, 111/314 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s29 1)), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 302 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p1||F(p2)))&&p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 182
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 181
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 98 place count 120 transition count 146
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 108 transition count 133
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 108 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 103 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 99 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 96 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 93 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 92 transition count 109
Applied a total of 161 rules in 16 ms. Remains 92 /163 variables (removed 71) and now considering 109/314 (removed 205) transitions.
// Phase 1: matrix 109 rows 92 cols
[2023-03-20 13:03:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:03:13] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-20 13:03:13] [INFO ] Invariant cache hit.
[2023-03-20 13:03:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:13] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-20 13:03:13] [INFO ] Invariant cache hit.
[2023-03-20 13:03:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/163 places, 109/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 92/163 places, 109/314 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s87 1)), p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 finished in 879 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(F(((!p0&&F(!p1))||X((G(F(!p1))||p2))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 13 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 13:03:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-20 13:03:14] [INFO ] Invariant cache hit.
[2023-03-20 13:03:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 13:03:14] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-20 13:03:14] [INFO ] Invariant cache hit.
[2023-03-20 13:03:14] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s30 1)), p2:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 finished in 1167 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 139 transition count 178
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 118 transition count 153
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 118 transition count 153
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 118 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 105 transition count 129
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 105 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 105 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 100 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 100 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 148 place count 95 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 95 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 91 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 91 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 88 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 84 transition count 98
Applied a total of 177 rules in 30 ms. Remains 84 /163 variables (removed 79) and now considering 98/314 (removed 216) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 13:03:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 13:03:15] [INFO ] Invariant cache hit.
[2023-03-20 13:03:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:03:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 13:03:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:03:15] [INFO ] Invariant cache hit.
[2023-03-20 13:03:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/163 places, 98/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 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]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 441 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)&&F(p1)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 24 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 13:03:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 13:03:15] [INFO ] Invariant cache hit.
[2023-03-20 13:03:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 13:03:15] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-20 13:03:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:03:15] [INFO ] Invariant cache hit.
[2023-03-20 13:03:16] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s86 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 448 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((F(p1)&&p0)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 173
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 173
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 67 place count 119 transition count 148
Iterating global reduction 0 with 21 rules applied. Total rules applied 88 place count 119 transition count 148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 119 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 111 place count 105 transition count 123
Iterating global reduction 1 with 14 rules applied. Total rules applied 125 place count 105 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 105 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 99 transition count 110
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 99 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 93 transition count 104
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 93 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 161 place count 88 transition count 98
Iterating global reduction 2 with 5 rules applied. Total rules applied 166 place count 88 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 168 place count 88 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 84 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 84 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 82 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 82 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 81 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 81 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 80 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 80 transition count 87
Applied a total of 184 rules in 24 ms. Remains 80 /163 variables (removed 83) and now considering 87/314 (removed 227) transitions.
// Phase 1: matrix 87 rows 80 cols
[2023-03-20 13:03:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:03:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 13:03:16] [INFO ] Invariant cache hit.
[2023-03-20 13:03:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 13:03:16] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-20 13:03:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:03:16] [INFO ] Invariant cache hit.
[2023-03-20 13:03:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/163 places, 87/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 80/163 places, 87/314 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s48 1)), p0:(AND (GEQ s1 1) (GEQ s79 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, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U G(!p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 120 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 109 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 121 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 94 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 93 transition count 110
Applied a total of 159 rules in 15 ms. Remains 93 /163 variables (removed 70) and now considering 110/314 (removed 204) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:03:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 13:03:16] [INFO ] Invariant cache hit.
[2023-03-20 13:03:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:16] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-20 13:03:16] [INFO ] Invariant cache hit.
[2023-03-20 13:03:16] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/163 places, 110/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 93/163 places, 110/314 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22456 reset in 160 ms.
Product exploration explored 100000 steps with 22468 reset in 174 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 647567 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 647567 steps, saw 288400 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-20 13:03:21] [INFO ] Invariant cache hit.
[2023-03-20 13:03:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:21] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 13:03:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:21] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 13:03:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:21] [INFO ] After 20ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 13:03:21] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-20 13:03:21] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 108
Applied a total of 3 rules in 6 ms. Remains 92 /93 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2211 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2268381 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :{}
Probabilistic random walk after 2268381 steps, saw 996992 distinct states, run finished after 3001 ms. (steps per millisecond=755 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2023-03-20 13:03:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 13:03:24] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:03:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:24] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:03:24] [INFO ] After 23ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:24] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 13:03:24] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-20 13:03:24] [INFO ] Invariant cache hit.
[2023-03-20 13:03:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 13:03:24] [INFO ] Invariant cache hit.
[2023-03-20 13:03:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:03:24] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-20 13:03:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:03:24] [INFO ] Invariant cache hit.
[2023-03-20 13:03:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 92/92 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 87 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 72 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 65 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 65 transition count 80
Applied a total of 57 rules in 7 ms. Remains 65 /92 variables (removed 27) and now considering 80/108 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 65 cols
[2023-03-20 13:03:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:03:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:24] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:03:24] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:24] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:03:25] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:03:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:03:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 13:03:25] [INFO ] Invariant cache hit.
[2023-03-20 13:03:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:25] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-20 13:03:25] [INFO ] Invariant cache hit.
[2023-03-20 13:03:26] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2228284 steps, run timeout after 3001 ms. (steps per millisecond=742 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2228284 steps, saw 955678 distinct states, run finished after 3001 ms. (steps per millisecond=742 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 13:03:29] [INFO ] Invariant cache hit.
[2023-03-20 13:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:03:29] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 13:03:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:30] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:30] [INFO ] After 16ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:30] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 13:03:30] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 91 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 90 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 89 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 88 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 87 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 85 transition count 91
Applied a total of 20 rules in 11 ms. Remains 85 /93 variables (removed 8) and now considering 91/110 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2533408 steps, run timeout after 3001 ms. (steps per millisecond=844 ) properties seen :{}
Probabilistic random walk after 2533408 steps, saw 1176690 distinct states, run finished after 3001 ms. (steps per millisecond=844 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2023-03-20 13:03:33] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 13:03:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:03:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:33] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:33] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 13:03:33] [INFO ] After 15ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:33] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 13:03:33] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-20 13:03:33] [INFO ] Invariant cache hit.
[2023-03-20 13:03:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 13:03:33] [INFO ] Invariant cache hit.
[2023-03-20 13:03:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 13:03:33] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-20 13:03:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:03:33] [INFO ] Invariant cache hit.
[2023-03-20 13:03:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 85/85 places, 91/91 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 80 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 64 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 60 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 65
Applied a total of 53 rules in 12 ms. Remains 60 /85 variables (removed 25) and now considering 65/91 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 60 cols
[2023-03-20 13:03:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:33] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 13:03:33] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:33] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:33] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 13:03:33] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 242 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22260 reset in 111 ms.
Product exploration explored 100000 steps with 22426 reset in 126 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 229 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-20 13:03:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:03:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:35] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 93/93 places, 110/110 transitions.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-20 13:03:35] [INFO ] Invariant cache hit.
[2023-03-20 13:03:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 13:03:35] [INFO ] Invariant cache hit.
[2023-03-20 13:03:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:03:35] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-20 13:03:35] [INFO ] Invariant cache hit.
[2023-03-20 13:03:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 93/93 places, 110/110 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 19350 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)||p1) U (X(X(p2)) U p3)))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 141 transition count 182
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 122 transition count 161
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 122 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 122 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 111 transition count 139
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 111 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 111 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 107 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 107 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 103 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 103 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 100 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 100 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 97 transition count 117
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 97 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 96 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 96 transition count 116
Applied a total of 152 rules in 13 ms. Remains 96 /163 variables (removed 67) and now considering 116/314 (removed 198) transitions.
// Phase 1: matrix 116 rows 96 cols
[2023-03-20 13:03:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 13:03:35] [INFO ] Invariant cache hit.
[2023-03-20 13:03:35] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-20 13:03:36] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-20 13:03:36] [INFO ] Invariant cache hit.
[2023-03-20 13:03:36] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/163 places, 116/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 96/163 places, 116/314 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p0||G(p1)))||(p2 U p3)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 142 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 142 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 142 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 124 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 124 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 124 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 113 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 113 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 113 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 109 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 109 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 106 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 106 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 104 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 103 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 102 transition count 139
Applied a total of 137 rules in 19 ms. Remains 102 /163 variables (removed 61) and now considering 139/314 (removed 175) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:03:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 13:03:36] [INFO ] Invariant cache hit.
[2023-03-20 13:03:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:03:36] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-20 13:03:36] [INFO ] Invariant cache hit.
[2023-03-20 13:03:36] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/163 places, 139/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 102/163 places, 139/314 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s97 1)), p3:(AND (GEQ s1 1) (GEQ s96 1)), p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22425 reset in 146 ms.
Product exploration explored 100000 steps with 22433 reset in 150 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 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 497 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 800855 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 800855 steps, saw 354537 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-20 13:03:41] [INFO ] Invariant cache hit.
[2023-03-20 13:03:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:41] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 13:03:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:03:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:41] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 13:03:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:03:41] [INFO ] After 44ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 13:03:41] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-20 13:03:41] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 25 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2251537 steps, run timeout after 3001 ms. (steps per millisecond=750 ) properties seen :{}
Probabilistic random walk after 2251537 steps, saw 977325 distinct states, run finished after 3001 ms. (steps per millisecond=750 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-20 13:03:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:03:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:03:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:44] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:44] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:03:44] [INFO ] After 22ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:44] [INFO ] After 41ms 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-20 13:03:44] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-20 13:03:44] [INFO ] Invariant cache hit.
[2023-03-20 13:03:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 13:03:45] [INFO ] Invariant cache hit.
[2023-03-20 13:03:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:03:45] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-20 13:03:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 13:03:45] [INFO ] Invariant cache hit.
[2023-03-20 13:03:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 6 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-20 13:03:45] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:03:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:45] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 13:03:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:03:45] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:45] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 13:03:45] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 639 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:03:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:03:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 13:03:46] [INFO ] Invariant cache hit.
[2023-03-20 13:03:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:03:46] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-20 13:03:46] [INFO ] Invariant cache hit.
[2023-03-20 13:03:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 102/102 places, 139/139 transitions.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 403 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1821440 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1821440 steps, saw 786571 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 13:03:50] [INFO ] Invariant cache hit.
[2023-03-20 13:03:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 13:03:50] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:50] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:03:50] [INFO ] After 41ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:50] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 13:03:51] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 25 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2080197 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :{}
Probabilistic random walk after 2080197 steps, saw 900675 distinct states, run finished after 3001 ms. (steps per millisecond=693 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-20 13:03:54] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 13:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:03:54] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:03:54] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:03:54] [INFO ] After 21ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:54] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 13:03:54] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-20 13:03:54] [INFO ] Invariant cache hit.
[2023-03-20 13:03:54] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-20 13:03:54] [INFO ] Invariant cache hit.
[2023-03-20 13:03:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:03:54] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2023-03-20 13:03:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:03:55] [INFO ] Invariant cache hit.
[2023-03-20 13:03:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 679 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 4 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-20 13:03:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:03:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:03:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:03:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:03:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 13:03:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:03:55] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:03:55] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:03:55] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22338 reset in 182 ms.
Product exploration explored 100000 steps with 22417 reset in 200 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-20 13:03:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:03:56] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 102/102 places, 139/139 transitions.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 0 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-20 13:03:56] [INFO ] Invariant cache hit.
[2023-03-20 13:03:56] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-20 13:03:56] [INFO ] Invariant cache hit.
[2023-03-20 13:03:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:03:56] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-20 13:03:56] [INFO ] Invariant cache hit.
[2023-03-20 13:03:57] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 102/102 places, 139/139 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 20669 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 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 117
Applied a total of 159 rules in 27 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 13:03:57] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:03:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-20 13:03:57] [INFO ] Invariant cache hit.
[2023-03-20 13:03:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 13:03:57] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-20 13:03:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:03:57] [INFO ] Invariant cache hit.
[2023-03-20 13:03:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/163 places, 117/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 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 (OR (LT s1 1) (LT s84 1)) (OR (LT s1 1) (LT s86 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 22389 reset in 128 ms.
Product exploration explored 100000 steps with 22425 reset in 200 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4402 steps, run visited all 1 properties in 10 ms. (steps per millisecond=440 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 10 ms. (steps per millisecond=440 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 13:03:58] [INFO ] Invariant cache hit.
[2023-03-20 13:03:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 13:03:58] [INFO ] Invariant cache hit.
[2023-03-20 13:03:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 13:03:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-20 13:03:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:03:59] [INFO ] Invariant cache hit.
[2023-03-20 13:03:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4402 steps, run visited all 1 properties in 13 ms. (steps per millisecond=338 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 13 ms. (steps per millisecond=338 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22395 reset in 129 ms.
Product exploration explored 100000 steps with 22576 reset in 141 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 13:03:59] [INFO ] Invariant cache hit.
[2023-03-20 13:03:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 13:03:59] [INFO ] Invariant cache hit.
[2023-03-20 13:03:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 13:04:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-20 13:04:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:00] [INFO ] Invariant cache hit.
[2023-03-20 13:04:00] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 finished in 3034 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((X(!p1)||p0))&&X(X(X(F(p2))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 187
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 163
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 120 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 108 transition count 141
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 108 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 108 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 104 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 104 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 100 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 100 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 96 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 96 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 93 transition count 117
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 91 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 89 transition count 112
Applied a total of 166 rules in 15 ms. Remains 89 /163 variables (removed 74) and now considering 112/314 (removed 202) transitions.
// Phase 1: matrix 112 rows 89 cols
[2023-03-20 13:04:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:04:00] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-20 13:04:00] [INFO ] Invariant cache hit.
[2023-03-20 13:04:00] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 13:04:00] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-20 13:04:00] [INFO ] Invariant cache hit.
[2023-03-20 13:04:00] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 112/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 89/163 places, 112/314 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (AND (NOT p0) p1)), p1, (AND (NOT p0) p1), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1)), p1:(AND (GEQ s1 1) (GEQ s84 1)), p2:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 692 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 139 transition count 178
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 118 transition count 153
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 118 transition count 153
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 118 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 105 transition count 129
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 105 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 105 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 100 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 100 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 148 place count 95 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 95 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 91 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 91 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 88 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 84 transition count 98
Applied a total of 177 rules in 16 ms. Remains 84 /163 variables (removed 79) and now considering 98/314 (removed 216) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 13:04:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:04:01] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-20 13:04:01] [INFO ] Invariant cache hit.
[2023-03-20 13:04:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:04:01] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-20 13:04:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:01] [INFO ] Invariant cache hit.
[2023-03-20 13:04:01] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/163 places, 98/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s78 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 22401 reset in 104 ms.
Product exploration explored 100000 steps with 22458 reset in 110 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 9 ms. (steps per millisecond=440 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 9 ms. (steps per millisecond=440 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[p0]
Stuttering acceptance computed with spot in 23 ms :[p0]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 13:04:01] [INFO ] Invariant cache hit.
[2023-03-20 13:04:02] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-20 13:04:02] [INFO ] Invariant cache hit.
[2023-03-20 13:04:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:04:02] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-20 13:04:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:02] [INFO ] Invariant cache hit.
[2023-03-20 13:04:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[p0]
Incomplete random walk after 10000 steps, including 2207 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 8 ms. (steps per millisecond=496 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 9 ms. (steps per millisecond=440 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[p0]
Stuttering acceptance computed with spot in 24 ms :[p0]
Stuttering acceptance computed with spot in 24 ms :[p0]
Product exploration explored 100000 steps with 22292 reset in 105 ms.
Product exploration explored 100000 steps with 22322 reset in 110 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 13:04:02] [INFO ] Invariant cache hit.
[2023-03-20 13:04:03] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-20 13:04:03] [INFO ] Invariant cache hit.
[2023-03-20 13:04:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:04:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-20 13:04:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:03] [INFO ] Invariant cache hit.
[2023-03-20 13:04:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 finished in 2488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U G(!p1)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 179
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 120 transition count 157
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 120 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 120 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 109 place count 108 transition count 134
Iterating global reduction 2 with 12 rules applied. Total rules applied 121 place count 108 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 104 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 94 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 93 transition count 110
Applied a total of 159 rules in 12 ms. Remains 93 /163 variables (removed 70) and now considering 110/314 (removed 204) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:04:03] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:04:03] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-20 13:04:03] [INFO ] Invariant cache hit.
[2023-03-20 13:04:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:04:04] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2023-03-20 13:04:04] [INFO ] Invariant cache hit.
[2023-03-20 13:04:04] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 93/163 places, 110/314 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 605 ms. Remains : 93/163 places, 110/314 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22461 reset in 117 ms.
Product exploration explored 100000 steps with 22523 reset in 131 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 745401 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 745401 steps, saw 329080 distinct states, run finished after 3002 ms. (steps per millisecond=248 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-20 13:04:08] [INFO ] Invariant cache hit.
[2023-03-20 13:04:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:08] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 13:04:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:08] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 13:04:08] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:04:08] [INFO ] After 19ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 13:04:08] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-20 13:04:08] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 108
Applied a total of 3 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2142123 steps, run timeout after 3001 ms. (steps per millisecond=713 ) properties seen :{}
Probabilistic random walk after 2142123 steps, saw 944357 distinct states, run finished after 3001 ms. (steps per millisecond=713 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2023-03-20 13:04:11] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:04:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:11] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:04:11] [INFO ] After 30ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:11] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 13:04:11] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-20 13:04:11] [INFO ] Invariant cache hit.
[2023-03-20 13:04:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 13:04:11] [INFO ] Invariant cache hit.
[2023-03-20 13:04:11] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:04:11] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-20 13:04:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:11] [INFO ] Invariant cache hit.
[2023-03-20 13:04:11] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 92/92 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 87 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 72 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 65 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 65 transition count 80
Applied a total of 57 rules in 5 ms. Remains 65 /92 variables (removed 27) and now considering 80/108 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 65 cols
[2023-03-20 13:04:11] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:04:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:04:11] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:11] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:04:11] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 0 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:04:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:04:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-20 13:04:12] [INFO ] Invariant cache hit.
[2023-03-20 13:04:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:04:12] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-20 13:04:12] [INFO ] Invariant cache hit.
[2023-03-20 13:04:13] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2129074 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2129074 steps, saw 909484 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 13:04:16] [INFO ] Invariant cache hit.
[2023-03-20 13:04:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:04:16] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:16] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:04:16] [INFO ] After 19ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:16] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-20 13:04:16] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 91 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 90 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 89 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 88 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 87 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 85 transition count 91
Applied a total of 20 rules in 11 ms. Remains 85 /93 variables (removed 8) and now considering 91/110 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2503784 steps, run timeout after 3001 ms. (steps per millisecond=834 ) properties seen :{}
Probabilistic random walk after 2503784 steps, saw 1162883 distinct states, run finished after 3001 ms. (steps per millisecond=834 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2023-03-20 13:04:19] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 13:04:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:04:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:19] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:19] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:19] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 13:04:19] [INFO ] After 12ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 13:04:19] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-20 13:04:19] [INFO ] Invariant cache hit.
[2023-03-20 13:04:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 13:04:20] [INFO ] Invariant cache hit.
[2023-03-20 13:04:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 13:04:20] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-20 13:04:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:20] [INFO ] Invariant cache hit.
[2023-03-20 13:04:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 85/85 places, 91/91 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 80 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 64 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 60 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 65
Applied a total of 53 rules in 7 ms. Remains 60 /85 variables (removed 25) and now considering 65/91 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 60 cols
[2023-03-20 13:04:20] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:04:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:20] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:20] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:20] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:20] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:20] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 13:04:20] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 188 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22424 reset in 106 ms.
Product exploration explored 100000 steps with 22388 reset in 128 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 195 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-20 13:04:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2023-03-20 13:04:21] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:04:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 93/93 places, 110/110 transitions.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-20 13:04:21] [INFO ] Invariant cache hit.
[2023-03-20 13:04:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 13:04:21] [INFO ] Invariant cache hit.
[2023-03-20 13:04:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 13:04:21] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-20 13:04:21] [INFO ] Invariant cache hit.
[2023-03-20 13:04:22] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 93/93 places, 110/110 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 18756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p0||G(p1)))||(p2 U p3)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 314/314 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 142 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 142 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 142 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 124 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 124 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 124 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 113 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 113 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 113 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 109 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 109 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 106 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 106 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 104 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 103 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 102 transition count 139
Applied a total of 137 rules in 14 ms. Remains 102 /163 variables (removed 61) and now considering 139/314 (removed 175) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:04:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:04:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 13:04:22] [INFO ] Invariant cache hit.
[2023-03-20 13:04:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:04:22] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-20 13:04:22] [INFO ] Invariant cache hit.
[2023-03-20 13:04:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/163 places, 139/314 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 360 ms. Remains : 102/163 places, 139/314 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s97 1)), p3:(AND (GEQ s1 1) (GEQ s96 1)), p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22408 reset in 227 ms.
Product exploration explored 100000 steps with 22537 reset in 213 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 467 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 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 466 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 754037 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 754037 steps, saw 334909 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-20 13:04:27] [INFO ] Invariant cache hit.
[2023-03-20 13:04:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:27] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 13:04:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:04:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:04:27] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 13:04:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:04:27] [INFO ] After 51ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 13:04:27] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-20 13:04:27] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 27 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2041850 steps, run timeout after 3001 ms. (steps per millisecond=680 ) properties seen :{}
Probabilistic random walk after 2041850 steps, saw 884753 distinct states, run finished after 3001 ms. (steps per millisecond=680 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-20 13:04:30] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:30] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:30] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:04:30] [INFO ] After 21ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:30] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 13:04:30] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-20 13:04:31] [INFO ] Invariant cache hit.
[2023-03-20 13:04:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 13:04:31] [INFO ] Invariant cache hit.
[2023-03-20 13:04:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:04:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 13:04:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:31] [INFO ] Invariant cache hit.
[2023-03-20 13:04:31] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 6 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-20 13:04:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:04:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:31] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:31] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:31] [INFO ] After 54ms 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-20 13:04:31] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) p1), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 551 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:04:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:04:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 13:04:32] [INFO ] Invariant cache hit.
[2023-03-20 13:04:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:04:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-20 13:04:32] [INFO ] Invariant cache hit.
[2023-03-20 13:04:32] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 102/102 places, 139/139 transitions.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2079936 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2079936 steps, saw 895156 distinct states, run finished after 3001 ms. (steps per millisecond=693 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 13:04:36] [INFO ] Invariant cache hit.
[2023-03-20 13:04:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:36] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:36] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:04:36] [INFO ] After 37ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:36] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 13:04:36] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 15 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2200 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2464614 steps, run timeout after 3001 ms. (steps per millisecond=821 ) properties seen :{}
Probabilistic random walk after 2464614 steps, saw 1071584 distinct states, run finished after 3001 ms. (steps per millisecond=821 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-20 13:04:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:04:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:39] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:04:39] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:04:39] [INFO ] After 19ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:39] [INFO ] After 39ms 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-20 13:04:39] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-20 13:04:39] [INFO ] Invariant cache hit.
[2023-03-20 13:04:40] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 13:04:40] [INFO ] Invariant cache hit.
[2023-03-20 13:04:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 13:04:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 13:04:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:04:40] [INFO ] Invariant cache hit.
[2023-03-20 13:04:40] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 5 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2023-03-20 13:04:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:04:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:04:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:04:40] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:04:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 13:04:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:04:40] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:04:40] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:04:40] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22325 reset in 218 ms.
Product exploration explored 100000 steps with 22358 reset in 204 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-20 13:04:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 102 cols
[2023-03-20 13:04:41] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:04:42] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 102/102 places, 139/139 transitions.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-20 13:04:42] [INFO ] Invariant cache hit.
[2023-03-20 13:04:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 13:04:42] [INFO ] Invariant cache hit.
[2023-03-20 13:04:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-20 13:04:42] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-20 13:04:42] [INFO ] Invariant cache hit.
[2023-03-20 13:04:42] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 102/102 places, 139/139 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 20361 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)))'
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)))'
[2023-03-20 13:04:42] [INFO ] Flatten gal took : 29 ms
[2023-03-20 13:04:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-20 13:04:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 314 transitions and 1239 arcs took 5 ms.
Total runtime 118318 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2485/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2485/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2485/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2485/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-LTLFireability-15

BK_STOP 1679317483612

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-09
ltl formula formula --ltl=/tmp/2485/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 163 places, 314 transitions and 1239 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.060 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2485/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2485/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2485/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2485/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-11
ltl formula formula --ltl=/tmp/2485/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 163 places, 314 transitions and 1239 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.090 real 0.000 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2485/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2485/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2485/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2485/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-12
ltl formula formula --ltl=/tmp/2485/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 314 transitions and 1239 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2485/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2485/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2485/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2485/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m96-LTLFireability-15
ltl formula formula --ltl=/tmp/2485/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 163 places, 314 transitions and 1239 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2485/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2485/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2485/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2485/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
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="SieveSingleMsgMbox-PT-d1m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978200444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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