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.r421-tajo-167905975300444.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 itstools
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 r421-tajo-167905975300444
=====================================================================

--------------------
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 1679180143124

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:55:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:55:45] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-18 22:55:45] [INFO ] Transformed 1295 places.
[2023-03-18 22:55:45] [INFO ] Transformed 749 transitions.
[2023-03-18 22:55:45] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 14 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 76 ms. Remains 163 /259 variables (removed 96) and now considering 314/749 (removed 435) transitions.
// Phase 1: matrix 314 rows 163 cols
[2023-03-18 22:55:46] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-18 22:55:46] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-18 22:55:46] [INFO ] Invariant cache hit.
[2023-03-18 22:55:46] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-18 22:55:46] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2023-03-18 22:55:46] [INFO ] Invariant cache hit.
[2023-03-18 22:55:47] [INFO ] Dead Transitions using invariants and state equation in 219 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 1167 ms. Remains : 163/259 places, 314/749 transitions.
Support contains 31 out of 163 places after structural reductions.
[2023-03-18 22:55:47] [INFO ] Flatten gal took : 74 ms
[2023-03-18 22:55:47] [INFO ] Flatten gal took : 28 ms
[2023-03-18 22:55:47] [INFO ] Input system was already deterministic with 314 transitions.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 113 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 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 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 1000 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-18 22:55:48] [INFO ] Invariant cache hit.
[2023-03-18 22:55:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:55:49] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:55:50] [INFO ] After 2164ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2023-03-18 22:55:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:55:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 22:55:51] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2023-03-18 22:55:51] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-18 22:55:53] [INFO ] After 1953ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :1 sat :26
[2023-03-18 22:55:53] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 8 ms to minimize.
[2023-03-18 22:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-18 22:55:53] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2023-03-18 22:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-18 22:55:56] [INFO ] After 4612ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :25
Attempting to minimize the solution found.
Minimization took 1828 ms.
[2023-03-18 22:55:58] [INFO ] After 7612ms 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 1321 ms.
Support contains 22 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 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 156 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 152 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 152 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 149 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 149 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 149 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 148 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 148 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 147 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 147 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 146 transition count 281
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 146 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 145 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 145 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 144 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 144 transition count 279
Applied a total of 41 rules in 61 ms. Remains 144 /163 variables (removed 19) and now considering 279/314 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 144/163 places, 279/314 transitions.
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 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 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 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 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 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 45 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 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 263206 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{1=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 263206 steps, saw 122774 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :13
Running SMT prover for 9 properties.
// Phase 1: matrix 279 rows 144 cols
[2023-03-18 22:56:03] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 22:56:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:03] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 22:56:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:03] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 22:56:03] [INFO ] State equation strengthened by 180 read => feed constraints.
[2023-03-18 22:56:04] [INFO ] After 587ms SMT Verify possible using 180 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-18 22:56:05] [INFO ] After 1197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 436 ms.
[2023-03-18 22:56:05] [INFO ] After 2027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 285 ms.
Support contains 10 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 279/279 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 133 transition count 196
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 133 transition count 196
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 133 transition count 194
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 123 transition count 182
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 123 transition count 182
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 123 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 119 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 119 transition count 174
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 119 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 118 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 118 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 117 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 117 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 116 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 116 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 69 place count 116 transition count 164
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 115 transition count 163
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 115 transition count 163
Applied a total of 71 rules in 38 ms. Remains 115 /144 variables (removed 29) and now considering 163/279 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 115/144 places, 163/279 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 293053 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293053 steps, saw 128666 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 163 rows 115 cols
[2023-03-18 22:56:09] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 22:56:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:10] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 22:56:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:10] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 22:56:10] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-18 22:56:10] [INFO ] After 165ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-18 22:56:10] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-18 22:56:10] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 1 properties in 365 ms.
Support contains 8 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 163/163 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 113 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 112 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 112 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 111 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 111 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 110 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 110 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 109 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 109 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 108 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 108 transition count 153
Applied a total of 15 rules in 23 ms. Remains 108 /115 variables (removed 7) and now considering 153/163 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 108/115 places, 153/163 transitions.
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 282063 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 282063 steps, saw 123813 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 153 rows 108 cols
[2023-03-18 22:56:15] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 22:56:15] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-18 22:56:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:15] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:56:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:15] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:56:15] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-18 22:56:15] [INFO ] After 205ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 22:56:16] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-18 22:56:16] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 146 ms.
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 153/153 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 108/108 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 153/153 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-18 22:56:16] [INFO ] Invariant cache hit.
[2023-03-18 22:56:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 22:56:16] [INFO ] Invariant cache hit.
[2023-03-18 22:56:16] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-18 22:56:16] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 22:56:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 22:56:16] [INFO ] Invariant cache hit.
[2023-03-18 22:56:16] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 108/108 places, 153/153 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 108 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 104 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 9 place count 104 transition count 133
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 39 place count 89 transition count 133
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 80 transition count 124
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 80 transition count 124
Applied a total of 59 rules in 29 ms. Remains 80 /108 variables (removed 28) and now considering 124/153 (removed 29) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 124 rows 80 cols
[2023-03-18 22:56:16] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 22:56:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:17] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:56:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:17] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:56:17] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2023-03-18 22:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-18 22:56:17] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-18 22:56:17] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
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.19 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 41 ms. Remains 96 /163 variables (removed 67) and now considering 114/314 (removed 200) transitions.
// Phase 1: matrix 114 rows 96 cols
[2023-03-18 22:56:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:56:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 22:56:18] [INFO ] Invariant cache hit.
[2023-03-18 22:56:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-18 22:56:18] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-18 22:56:18] [INFO ] Invariant cache hit.
[2023-03-18 22:56:18] [INFO ] Dead Transitions using invariants and state equation in 71 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 386 ms. Remains : 96/163 places, 114/314 transitions.
Stuttering acceptance computed with spot in 387 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 3 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 876 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 25 ms. Remains 94 /163 variables (removed 69) and now considering 111/314 (removed 203) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-18 22:56:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:56:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 22:56:19] [INFO ] Invariant cache hit.
[2023-03-18 22:56:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:19] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-18 22:56:19] [INFO ] Invariant cache hit.
[2023-03-18 22:56:19] [INFO ] Dead Transitions using invariants and state equation in 91 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 371 ms. Remains : 94/163 places, 111/314 transitions.
Stuttering acceptance computed with spot in 126 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 419 ms.
Product exploration explored 100000 steps with 50000 reset in 317 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.3 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 138 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 1406 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 19 ms. Remains 92 /163 variables (removed 71) and now considering 109/314 (removed 205) transitions.
// Phase 1: matrix 109 rows 92 cols
[2023-03-18 22:56:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:56:20] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 22:56:20] [INFO ] Invariant cache hit.
[2023-03-18 22:56:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:20] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-18 22:56:20] [INFO ] Invariant cache hit.
[2023-03-18 22:56:20] [INFO ] Dead Transitions using invariants and state equation in 87 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 391 ms. Remains : 92/163 places, 109/314 transitions.
Stuttering acceptance computed with spot in 323 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 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 finished in 732 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 25 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:56:21] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-18 22:56:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 22:56:21] [INFO ] Invariant cache hit.
[2023-03-18 22:56:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:56:21] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-18 22:56:21] [INFO ] Invariant cache hit.
[2023-03-18 22:56:21] [INFO ] Dead Transitions using invariants and state equation in 69 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 376 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 225 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 280 ms.
Product exploration explored 100000 steps with 50000 reset in 263 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 139 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 1320 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-18 22:56:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-18 22:56:22] [INFO ] Invariant cache hit.
[2023-03-18 22:56:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:56:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-18 22:56:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:56:22] [INFO ] Invariant cache hit.
[2023-03-18 22:56:22] [INFO ] Dead Transitions using invariants and state equation in 65 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 324 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 82 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 426 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 36 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:56:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:56:22] [INFO ] Invariant cache hit.
[2023-03-18 22:56:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:56:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-18 22:56:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:56:23] [INFO ] Invariant cache hit.
[2023-03-18 22:56:23] [INFO ] Dead Transitions using invariants and state equation in 92 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 410 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 150 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 580 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 30 ms. Remains 80 /163 variables (removed 83) and now considering 87/314 (removed 227) transitions.
// Phase 1: matrix 87 rows 80 cols
[2023-03-18 22:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:56:23] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 22:56:23] [INFO ] Invariant cache hit.
[2023-03-18 22:56:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-18 22:56:23] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-18 22:56:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:56:23] [INFO ] Invariant cache hit.
[2023-03-18 22:56:23] [INFO ] Dead Transitions using invariants and state equation in 54 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 311 ms. Remains : 80/163 places, 87/314 transitions.
Stuttering acceptance computed with spot in 95 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 7 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 finished in 432 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 16 ms. Remains 93 /163 variables (removed 70) and now considering 110/314 (removed 204) transitions.
// Phase 1: matrix 110 rows 93 cols
[2023-03-18 22:56:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 22:56:23] [INFO ] Invariant cache hit.
[2023-03-18 22:56:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:24] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-18 22:56:24] [INFO ] Invariant cache hit.
[2023-03-18 22:56:24] [INFO ] Dead Transitions using invariants and state equation in 65 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 355 ms. Remains : 93/163 places, 110/314 transitions.
Stuttering acceptance computed with spot in 228 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 22400 reset in 213 ms.
Product exploration explored 100000 steps with 22364 reset in 253 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.2 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 227 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 225 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 615864 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 615864 steps, saw 275099 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-18 22:56:28] [INFO ] Invariant cache hit.
[2023-03-18 22:56:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:29] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 22:56:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:29] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 22:56:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:29] [INFO ] After 23ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-18 22:56:29] [INFO ] After 41ms 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-18 22:56:29] [INFO ] After 144ms 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 17 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 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 6 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2416669 steps, run timeout after 3001 ms. (steps per millisecond=805 ) properties seen :{}
Probabilistic random walk after 2416669 steps, saw 1061334 distinct states, run finished after 3002 ms. (steps per millisecond=805 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2023-03-18 22:56:32] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 22:56:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:32] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:56:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:56:32] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 22:56:32] [INFO ] After 21ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:32] [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 24 ms.
[2023-03-18 22:56:32] [INFO ] After 180ms 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 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-18 22:56:32] [INFO ] Invariant cache hit.
[2023-03-18 22:56:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 22:56:32] [INFO ] Invariant cache hit.
[2023-03-18 22:56:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-18 22:56:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-18 22:56:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:56:32] [INFO ] Invariant cache hit.
[2023-03-18 22:56:32] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 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 6 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-18 22:56:32] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:56:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 22:56:32] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 22:56:32] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:33] [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 11 ms.
[2023-03-18 22:56:33] [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 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 348 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 257 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 230 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-18 22:56:33] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 22:56:33] [INFO ] Invariant cache hit.
[2023-03-18 22:56:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:34] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 22:56:34] [INFO ] Invariant cache hit.
[2023-03-18 22:56:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 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.2 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 273 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 258 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1961330 steps, run timeout after 3001 ms. (steps per millisecond=653 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1961330 steps, saw 842932 distinct states, run finished after 3001 ms. (steps per millisecond=653 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-18 22:56:38] [INFO ] Invariant cache hit.
[2023-03-18 22:56:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 22:56:38] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:56:38] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-18 22:56:38] [INFO ] After 18ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:38] [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 40 ms.
[2023-03-18 22:56:38] [INFO ] After 151ms 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.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
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 10 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 10 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2677897 steps, run timeout after 3001 ms. (steps per millisecond=892 ) properties seen :{}
Probabilistic random walk after 2677897 steps, saw 1239981 distinct states, run finished after 3001 ms. (steps per millisecond=892 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2023-03-18 22:56:41] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:56:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:56:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:41] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:56:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:41] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 22:56:41] [INFO ] After 16ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:41] [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 9 ms.
[2023-03-18 22:56:41] [INFO ] After 120ms 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 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 1 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 1 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-18 22:56:41] [INFO ] Invariant cache hit.
[2023-03-18 22:56:42] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 22:56:42] [INFO ] Invariant cache hit.
[2023-03-18 22:56:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 22:56:42] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-18 22:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:56:42] [INFO ] Invariant cache hit.
[2023-03-18 22:56:42] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 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 6 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-18 22:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 22:56:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:42] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:56:42] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:56:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:42] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:42] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:56:42] [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 9 ms.
[2023-03-18 22:56:42] [INFO ] After 109ms 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 303 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 197 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 265 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22495 reset in 109 ms.
Product exploration explored 100000 steps with 22409 reset in 129 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 220 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 10 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-18 22:56:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2023-03-18 22:56:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:44] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 93/93 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin14023629691623599276
[2023-03-18 22:56:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14023629691623599276
Running compilation step : cd /tmp/ltsmin14023629691623599276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 462 ms.
Running link step : cd /tmp/ltsmin14023629691623599276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin14023629691623599276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2737047554752405310.hoa' '--buchi-type=spotba'
LTSmin run took 6658 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 27857 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 12 ms. Remains 96 /163 variables (removed 67) and now considering 116/314 (removed 198) transitions.
// Phase 1: matrix 116 rows 96 cols
[2023-03-18 22:56:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:56:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-18 22:56:51] [INFO ] Invariant cache hit.
[2023-03-18 22:56:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-18 22:56:52] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-18 22:56:52] [INFO ] Invariant cache hit.
[2023-03-18 22:56:52] [INFO ] Dead Transitions using invariants and state equation in 102 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 435 ms. Remains : 96/163 places, 116/314 transitions.
Stuttering acceptance computed with spot in 571 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 3 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 1031 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 51 ms. Remains 102 /163 variables (removed 61) and now considering 139/314 (removed 175) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-18 22:56:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:56:52] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-18 22:56:52] [INFO ] Invariant cache hit.
[2023-03-18 22:56:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-18 22:56:53] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-18 22:56:53] [INFO ] Invariant cache hit.
[2023-03-18 22:56:53] [INFO ] Dead Transitions using invariants and state equation in 136 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 598 ms. Remains : 102/163 places, 139/314 transitions.
Stuttering acceptance computed with spot in 172 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 22457 reset in 176 ms.
Product exploration explored 100000 steps with 22373 reset in 177 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.2 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 535 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 224 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 2223 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 678276 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 678276 steps, saw 302465 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-18 22:56:58] [INFO ] Invariant cache hit.
[2023-03-18 22:56:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:56:58] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 22:56:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:56:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:56:58] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 22:56:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-18 22:56:58] [INFO ] After 53ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-18 22:56:58] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-18 22:56:58] [INFO ] After 266ms 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.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 28 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 28 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 535 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2543672 steps, run timeout after 3001 ms. (steps per millisecond=847 ) properties seen :{}
Probabilistic random walk after 2543672 steps, saw 1105110 distinct states, run finished after 3002 ms. (steps per millisecond=847 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-18 22:57:01] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:57:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:01] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:01] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-18 22:57:01] [INFO ] After 25ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:01] [INFO ] After 49ms 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-18 22:57:01] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 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 3 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-18 22:57:01] [INFO ] Invariant cache hit.
[2023-03-18 22:57:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 22:57:02] [INFO ] Invariant cache hit.
[2023-03-18 22:57:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-18 22:57:02] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 22:57:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:57:02] [INFO ] Invariant cache hit.
[2023-03-18 22:57:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 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-18 22:57:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 22:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:02] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:02] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:02] [INFO ] After 62ms 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-18 22:57:02] [INFO ] After 114ms 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 675 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 206 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 186 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 2 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-18 22:57:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:57:03] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 22:57:03] [INFO ] Invariant cache hit.
[2023-03-18 22:57:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-18 22:57:03] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-18 22:57:03] [INFO ] Invariant cache hit.
[2023-03-18 22:57:04] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 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.2 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 447 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 195 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 2275 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1918618 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1918618 steps, saw 826278 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-18 22:57:08] [INFO ] Invariant cache hit.
[2023-03-18 22:57:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:57:08] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:57:08] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-18 22:57:08] [INFO ] After 48ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:08] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-18 22:57:08] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 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 15 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2121596 steps, run timeout after 3001 ms. (steps per millisecond=706 ) properties seen :{}
Probabilistic random walk after 2121596 steps, saw 918154 distinct states, run finished after 3001 ms. (steps per millisecond=706 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2023-03-18 22:57:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 22:57:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:11] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:11] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-18 22:57:11] [INFO ] After 22ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:11] [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 14 ms.
[2023-03-18 22:57:11] [INFO ] After 156ms 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 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-18 22:57:11] [INFO ] Invariant cache hit.
[2023-03-18 22:57:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 22:57:11] [INFO ] Invariant cache hit.
[2023-03-18 22:57:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-18 22:57:12] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-18 22:57:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:57:12] [INFO ] Invariant cache hit.
[2023-03-18 22:57:12] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 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 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-18 22:57:12] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 22:57:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 22:57:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:57:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:12] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:57:12] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 22:57:12] [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 478 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 187 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 181 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 212 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 22455 reset in 194 ms.
Product exploration explored 100000 steps with 22475 reset in 179 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 166 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-18 22:57:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 139 rows 102 cols
[2023-03-18 22:57:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:57:14] [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 112 ms. Remains : 102/102 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin7863109802898148761
[2023-03-18 22:57:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7863109802898148761
Running compilation step : cd /tmp/ltsmin7863109802898148761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin7863109802898148761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7863109802898148761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7072524872218112779.hoa' '--buchi-type=spotba'
LTSmin run took 2054 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 23901 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 12 ms. Remains 91 /163 variables (removed 72) and now considering 117/314 (removed 197) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:57:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:57:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 22:57:16] [INFO ] Invariant cache hit.
[2023-03-18 22:57:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:57:16] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-18 22:57:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:57:16] [INFO ] Invariant cache hit.
[2023-03-18 22:57:16] [INFO ] Dead Transitions using invariants and state equation in 53 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 315 ms. Remains : 91/163 places, 117/314 transitions.
Stuttering acceptance computed with spot in 31 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 22427 reset in 123 ms.
Product exploration explored 100000 steps with 22445 reset in 134 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 130 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 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 11 ms. (steps per millisecond=400 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 11 ms. (steps per millisecond=400 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 188 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 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 5 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 22:57:17] [INFO ] Invariant cache hit.
[2023-03-18 22:57:17] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 22:57:17] [INFO ] Invariant cache hit.
[2023-03-18 22:57:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:57:18] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-18 22:57:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:57:18] [INFO ] Invariant cache hit.
[2023-03-18 22:57:18] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 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 163 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4402 steps, run visited all 1 properties in 15 ms. (steps per millisecond=293 )
Probabilistic random walk after 4402 steps, saw 1996 distinct states, run finished after 16 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22393 reset in 170 ms.
Product exploration explored 100000 steps with 22468 reset in 209 ms.
Built C files in :
/tmp/ltsmin2060169216383835811
[2023-03-18 22:57:19] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2023-03-18 22:57:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:19] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2023-03-18 22:57:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:19] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2023-03-18 22:57:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:19] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2060169216383835811
Running compilation step : cd /tmp/ltsmin2060169216383835811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin2060169216383835811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2060169216383835811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11211350649853997753.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 finished in 3185 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 12 ms. Remains 89 /163 variables (removed 74) and now considering 112/314 (removed 202) transitions.
// Phase 1: matrix 112 rows 89 cols
[2023-03-18 22:57:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:57:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 22:57:19] [INFO ] Invariant cache hit.
[2023-03-18 22:57:19] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-18 22:57:20] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-18 22:57:20] [INFO ] Invariant cache hit.
[2023-03-18 22:57:20] [INFO ] Dead Transitions using invariants and state equation in 61 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 299 ms. Remains : 89/163 places, 112/314 transitions.
Stuttering acceptance computed with spot in 358 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 17 steps with 3 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 686 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 34 ms. Remains 84 /163 variables (removed 79) and now considering 98/314 (removed 216) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-18 22:57:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:57:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 22:57:20] [INFO ] Invariant cache hit.
[2023-03-18 22:57:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:57:20] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 22:57:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:57:20] [INFO ] Invariant cache hit.
[2023-03-18 22:57:20] [INFO ] Dead Transitions using invariants and state equation in 61 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 334 ms. Remains : 84/163 places, 98/314 transitions.
Stuttering acceptance computed with spot in 34 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 22464 reset in 126 ms.
Product exploration explored 100000 steps with 22468 reset in 128 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 155 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 36 ms :[p0]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 12 ms. (steps per millisecond=330 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 12 ms. (steps per millisecond=330 ) 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 178 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 36 ms :[p0]
Stuttering acceptance computed with spot in 58 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 4 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 22:57:21] [INFO ] Invariant cache hit.
[2023-03-18 22:57:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 22:57:21] [INFO ] Invariant cache hit.
[2023-03-18 22:57:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:57:21] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-18 22:57:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:57:21] [INFO ] Invariant cache hit.
[2023-03-18 22:57:21] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 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 98 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 33 ms :[p0]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3968 steps, run visited all 1 properties in 11 ms. (steps per millisecond=360 )
Probabilistic random walk after 3968 steps, saw 1817 distinct states, run finished after 12 ms. (steps per millisecond=330 ) 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 138 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 33 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Product exploration explored 100000 steps with 22426 reset in 129 ms.
Product exploration explored 100000 steps with 22497 reset in 133 ms.
Built C files in :
/tmp/ltsmin16922270339591797857
[2023-03-18 22:57:22] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2023-03-18 22:57:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:22] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2023-03-18 22:57:22] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:22] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2023-03-18 22:57:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:57:22] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16922270339591797857
Running compilation step : cd /tmp/ltsmin16922270339591797857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin16922270339591797857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16922270339591797857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16238499016038222344.hoa' '--buchi-type=spotba'
LTSmin run took 226 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 finished in 2790 ms.
All properties solved by simple procedures.
Total runtime 97669 ms.

BK_STOP 1679180243601

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r421-tajo-167905975300444"
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 ;