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.r423-tajo-167905976800476.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 lolaxred
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 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.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 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 1.1M 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-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679248747191

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:59:08] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-19 17:59:08] [INFO ] Transformed 2398 places.
[2023-03-19 17:59:08] [INFO ] Transformed 1954 transitions.
[2023-03-19 17:59:09] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 952 place count 290 transition count 660
Iterating global reduction 1 with 99 rules applied. Total rules applied 1051 place count 290 transition count 660
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1060 place count 290 transition count 651
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1135 place count 215 transition count 576
Iterating global reduction 2 with 75 rules applied. Total rules applied 1210 place count 215 transition count 576
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1246 place count 215 transition count 540
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1272 place count 189 transition count 510
Iterating global reduction 3 with 26 rules applied. Total rules applied 1298 place count 189 transition count 510
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1376 place count 189 transition count 432
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1383 place count 182 transition count 420
Iterating global reduction 4 with 7 rules applied. Total rules applied 1390 place count 182 transition count 420
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1396 place count 176 transition count 414
Iterating global reduction 4 with 6 rules applied. Total rules applied 1402 place count 176 transition count 414
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1405 place count 173 transition count 410
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 173 transition count 410
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1410 place count 171 transition count 408
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 171 transition count 408
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1413 place count 170 transition count 407
Iterating global reduction 4 with 1 rules applied. Total rules applied 1414 place count 170 transition count 407
Applied a total of 1414 rules in 86 ms. Remains 170 /414 variables (removed 244) and now considering 407/1954 (removed 1547) transitions.
// Phase 1: matrix 407 rows 170 cols
[2023-03-19 17:59:09] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-19 17:59:09] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-19 17:59:09] [INFO ] Invariant cache hit.
[2023-03-19 17:59:09] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-19 17:59:10] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-19 17:59:10] [INFO ] Invariant cache hit.
[2023-03-19 17:59:10] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/414 places, 407/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1217 ms. Remains : 170/414 places, 407/1954 transitions.
Support contains 26 out of 170 places after structural reductions.
[2023-03-19 17:59:10] [INFO ] Flatten gal took : 54 ms
[2023-03-19 17:59:10] [INFO ] Flatten gal took : 22 ms
[2023-03-19 17:59:10] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 25 out of 170 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 327858 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{1=1, 4=1, 6=1, 8=1, 9=1, 11=1, 12=1, 13=1, 19=1, 22=1}
Probabilistic random walk after 327858 steps, saw 150234 distinct states, run finished after 3004 ms. (steps per millisecond=109 ) properties seen :10
Running SMT prover for 13 properties.
[2023-03-19 17:59:14] [INFO ] Invariant cache hit.
[2023-03-19 17:59:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:59:15] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 17:59:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:59:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:59:15] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 17:59:15] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-19 17:59:17] [INFO ] After 1525ms SMT Verify possible using 277 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-19 17:59:18] [INFO ] After 3066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1614 ms.
[2023-03-19 17:59:20] [INFO ] After 5475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 357 ms.
Support contains 16 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 407/407 transitions.
Graph (complete) has 672 edges and 170 vertex of which 169 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 169 transition count 405
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 161 transition count 335
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 161 transition count 335
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 154 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 154 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 154 transition count 325
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 149 transition count 317
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 149 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 149 transition count 314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 148 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 148 transition count 313
Applied a total of 51 rules in 46 ms. Remains 148 /170 variables (removed 22) and now considering 313/407 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 148/170 places, 313/407 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 508961 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{0=1}
Probabilistic random walk after 508961 steps, saw 226427 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :1
Running SMT prover for 12 properties.
// Phase 1: matrix 313 rows 148 cols
[2023-03-19 17:59:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:59:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:59:25] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 17:59:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:59:25] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 17:59:25] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-19 17:59:26] [INFO ] After 911ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 17:59:27] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2023-03-19 17:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-19 17:59:27] [INFO ] After 1854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 677 ms.
[2023-03-19 17:59:28] [INFO ] After 2982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 364 ms.
Support contains 15 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 313/313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 146 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 146 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 145 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 145 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 145 transition count 296
Applied a total of 7 rules in 34 ms. Remains 145 /148 variables (removed 3) and now considering 296/313 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 145/148 places, 296/313 transitions.
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 383 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 494118 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494118 steps, saw 217634 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 296 rows 145 cols
[2023-03-19 17:59:32] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:59:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:59:32] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 17:59:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:59:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:59:33] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 17:59:33] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-19 17:59:33] [INFO ] After 768ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 17:59:34] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 ms to minimize.
[2023-03-19 17:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-19 17:59:35] [INFO ] After 1882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1096 ms.
[2023-03-19 17:59:36] [INFO ] After 3323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 172 ms.
Support contains 15 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 145/145 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-19 17:59:36] [INFO ] Invariant cache hit.
[2023-03-19 17:59:36] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-19 17:59:36] [INFO ] Invariant cache hit.
[2023-03-19 17:59:36] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-19 17:59:37] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-19 17:59:37] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-19 17:59:37] [INFO ] Invariant cache hit.
[2023-03-19 17:59:37] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 145/145 places, 296/296 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 145 transition count 291
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 141 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 140 transition count 290
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 11 place count 140 transition count 276
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 39 place count 126 transition count 276
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 112 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 111 transition count 272
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 111 transition count 271
Applied a total of 70 rules in 33 ms. Remains 111 /145 variables (removed 34) and now considering 271/296 (removed 25) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 271 rows 111 cols
[2023-03-19 17:59:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:59:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:59:37] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 17:59:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:59:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:59:38] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 17:59:38] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2023-03-19 17:59:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-19 17:59:38] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2023-03-19 17:59:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-19 17:59:38] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-19 17:59:39] [INFO ] After 1384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36 stabilizing places and 61 stable transitions
Graph (complete) has 734 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 130 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 110 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 108 transition count 133
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 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 128
Applied a total of 150 rules in 12 ms. Remains 105 /170 variables (removed 65) and now considering 128/407 (removed 279) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-19 17:59:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:59:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 17:59:39] [INFO ] Invariant cache hit.
[2023-03-19 17:59:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:39] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-19 17:59:39] [INFO ] Invariant cache hit.
[2023-03-19 17:59:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 128/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 105/170 places, 128/407 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22417 reset in 194 ms.
Product exploration explored 100000 steps with 22583 reset in 154 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 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 505 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 247 ms. (steps per millisecond=717 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 247 ms. (steps per millisecond=717 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 17:59:41] [INFO ] Invariant cache hit.
[2023-03-19 17:59:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 17:59:41] [INFO ] Invariant cache hit.
[2023-03-19 17:59:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:41] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-19 17:59:41] [INFO ] Invariant cache hit.
[2023-03-19 17:59:41] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 303 ms. (steps per millisecond=585 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 303 ms. (steps per millisecond=585 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22379 reset in 120 ms.
Product exploration explored 100000 steps with 22472 reset in 202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 15 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 17:59:42] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 17:59:42] [INFO ] Invariant cache hit.
[2023-03-19 17:59:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 105/105 places, 128/128 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 17:59:42] [INFO ] Invariant cache hit.
[2023-03-19 17:59:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 17:59:43] [INFO ] Invariant cache hit.
[2023-03-19 17:59:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:43] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-19 17:59:43] [INFO ] Invariant cache hit.
[2023-03-19 17:59:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 105/105 places, 128/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 4066 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(p1)&&p0))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 112 transition count 152
Applied a total of 132 rules in 31 ms. Remains 112 /170 variables (removed 58) and now considering 152/407 (removed 255) transitions.
// Phase 1: matrix 152 rows 112 cols
[2023-03-19 17:59:43] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-19 17:59:43] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-19 17:59:43] [INFO ] Invariant cache hit.
[2023-03-19 17:59:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-19 17:59:43] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-19 17:59:43] [INFO ] Invariant cache hit.
[2023-03-19 17:59:43] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/170 places, 152/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 112/170 places, 152/407 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(OR (LT s1 1) (LT s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 615 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 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 21 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 17:59:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:59:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 17:59:44] [INFO ] Invariant cache hit.
[2023-03-19 17:59:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:44] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-19 17:59:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:59:44] [INFO ] Invariant cache hit.
[2023-03-19 17:59:44] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 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 22523 reset in 176 ms.
Product exploration explored 100000 steps with 22456 reset in 153 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 1410 ms. (steps per millisecond=904 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 1411 ms. (steps per millisecond=903 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 17:59:46] [INFO ] Invariant cache hit.
[2023-03-19 17:59:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 17:59:46] [INFO ] Invariant cache hit.
[2023-03-19 17:59:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:46] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 17:59:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:59:46] [INFO ] Invariant cache hit.
[2023-03-19 17:59:46] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 1413 ms. (steps per millisecond=902 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 1413 ms. (steps per millisecond=902 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22506 reset in 162 ms.
Product exploration explored 100000 steps with 22456 reset in 149 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 17:59:49] [INFO ] Invariant cache hit.
[2023-03-19 17:59:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 17:59:49] [INFO ] Invariant cache hit.
[2023-03-19 17:59:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:59:49] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-19 17:59:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:59:49] [INFO ] Invariant cache hit.
[2023-03-19 17:59:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 5430 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((X(G(p1))||p0))&&F(p2))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 204
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 131 transition count 185
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 131 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 131 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 118 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 115 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 113 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 113 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 109 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 108 transition count 134
Applied a total of 142 rules in 25 ms. Remains 108 /170 variables (removed 62) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-19 17:59:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:59:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 17:59:49] [INFO ] Invariant cache hit.
[2023-03-19 17:59:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 17:59:49] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-19 17:59:49] [INFO ] Invariant cache hit.
[2023-03-19 17:59:49] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 134/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 108/170 places, 134/407 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s1 1) (LT s103 1)), p1:(AND (GEQ s1 1) (GEQ s96 1)), p0:(OR (LT s1 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Product exploration explored 100000 steps with 22383 reset in 232 ms.
Product exploration explored 100000 steps with 22561 reset in 217 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 434 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2291570 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :{0=1}
Probabilistic random walk after 2291570 steps, saw 945508 distinct states, run finished after 3001 ms. (steps per millisecond=763 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 17:59:54] [INFO ] Invariant cache hit.
[2023-03-19 17:59:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:54] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:59:54] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:59:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:54] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:59:54] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:59:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 17:59:54] [INFO ] After 25ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:59:54] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-19 17:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-19 17:59:54] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 17:59:54] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 16 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2564750 steps, run timeout after 3001 ms. (steps per millisecond=854 ) properties seen :{}
Probabilistic random walk after 2564750 steps, saw 1075588 distinct states, run finished after 3001 ms. (steps per millisecond=854 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-19 17:59:57] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:59:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:59:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:59:57] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:59:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:59:57] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:59:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 17:59:57] [INFO ] After 17ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:59:57] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 17:59:57] [INFO ] After 124ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-19 17:59:57] [INFO ] Invariant cache hit.
[2023-03-19 17:59:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 17:59:57] [INFO ] Invariant cache hit.
[2023-03-19 17:59:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 17:59:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-19 17:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:59:58] [INFO ] Invariant cache hit.
[2023-03-19 17:59:58] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 12 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-19 17:59:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:59:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:59:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-19 17:59:58] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:59:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:59:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:59:58] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:59:58] [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 9 ms.
[2023-03-19 17:59:58] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 516 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-19 17:59:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:59:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-19 17:59:59] [INFO ] Invariant cache hit.
[2023-03-19 17:59:59] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 17:59:59] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-19 17:59:59] [INFO ] Invariant cache hit.
[2023-03-19 17:59:59] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 108/108 places, 134/134 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2440644 steps, run timeout after 3001 ms. (steps per millisecond=813 ) properties seen :{0=1}
Probabilistic random walk after 2440644 steps, saw 1009401 distinct states, run finished after 3001 ms. (steps per millisecond=813 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 18:00:02] [INFO ] Invariant cache hit.
[2023-03-19 18:00:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 18:00:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:02] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:00:02] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 18:00:02] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:02] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 18:00:03] [INFO ] After 17ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:03] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-19 18:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-19 18:00:03] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 18:00:03] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 11 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2296 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 466 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2603830 steps, run timeout after 3001 ms. (steps per millisecond=867 ) properties seen :{}
Probabilistic random walk after 2603830 steps, saw 1091977 distinct states, run finished after 3001 ms. (steps per millisecond=867 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-19 18:00:06] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 18:00:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:00:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:06] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:00:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:06] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:06] [INFO ] After 16ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:06] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 18:00:06] [INFO ] After 108ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-19 18:00:06] [INFO ] Invariant cache hit.
[2023-03-19 18:00:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 18:00:06] [INFO ] Invariant cache hit.
[2023-03-19 18:00:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:06] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-19 18:00:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:06] [INFO ] Invariant cache hit.
[2023-03-19 18:00:06] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 10 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-19 18:00:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 18:00:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:06] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:00:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:06] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:06] [INFO ] After 51ms 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-19 18:00:06] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22460 reset in 102 ms.
Product exploration explored 100000 steps with 22294 reset in 108 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-19 18:00:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 108 cols
[2023-03-19 18:00:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:07] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 108/108 places, 134/134 transitions.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-19 18:00:07] [INFO ] Invariant cache hit.
[2023-03-19 18:00:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 18:00:07] [INFO ] Invariant cache hit.
[2023-03-19 18:00:07] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 18:00:08] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-19 18:00:08] [INFO ] Invariant cache hit.
[2023-03-19 18:00:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 108/108 places, 134/134 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 18771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 10 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:00:08] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-19 18:00:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 18:00:08] [INFO ] Invariant cache hit.
[2023-03-19 18:00:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:08] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-19 18:00:08] [INFO ] Invariant cache hit.
[2023-03-19 18:00:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22309 reset in 102 ms.
Product exploration explored 100000 steps with 22349 reset in 105 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2225 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 453 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 8 ms. (steps per millisecond=390 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 8 ms. (steps per millisecond=390 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:09] [INFO ] Invariant cache hit.
[2023-03-19 18:00:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 18:00:09] [INFO ] Invariant cache hit.
[2023-03-19 18:00:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-19 18:00:09] [INFO ] Invariant cache hit.
[2023-03-19 18:00:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2259 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 480 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 8 ms. (steps per millisecond=390 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 8 ms. (steps per millisecond=390 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22412 reset in 137 ms.
Product exploration explored 100000 steps with 22524 reset in 146 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:10] [INFO ] Invariant cache hit.
[2023-03-19 18:00:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 105/105 places, 129/129 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:10] [INFO ] Invariant cache hit.
[2023-03-19 18:00:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 18:00:10] [INFO ] Invariant cache hit.
[2023-03-19 18:00:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:11] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-19 18:00:11] [INFO ] Invariant cache hit.
[2023-03-19 18:00:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 3043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 216
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 133 transition count 198
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 133 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 133 transition count 191
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 121 transition count 171
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 121 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 118 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 118 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 116 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 115 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Applied a total of 130 rules in 8 ms. Remains 113 /170 variables (removed 57) and now considering 153/407 (removed 254) transitions.
// Phase 1: matrix 153 rows 113 cols
[2023-03-19 18:00:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 18:00:11] [INFO ] Invariant cache hit.
[2023-03-19 18:00:11] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-19 18:00:11] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-19 18:00:11] [INFO ] Invariant cache hit.
[2023-03-19 18:00:11] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 153/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 113/170 places, 153/407 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1) (OR (LT s1 1) (LT s41 1)) (OR (LT s1 1) (LT s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 400 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))&&X(F(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 116 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 113 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 137 place count 111 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 109 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 108 transition count 145
Applied a total of 143 rules in 13 ms. Remains 108 /170 variables (removed 62) and now considering 145/407 (removed 262) transitions.
// Phase 1: matrix 145 rows 108 cols
[2023-03-19 18:00:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 18:00:11] [INFO ] Invariant cache hit.
[2023-03-19 18:00:11] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-19 18:00:11] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-19 18:00:11] [INFO ] Invariant cache hit.
[2023-03-19 18:00:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 145/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 108/170 places, 145/407 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s102 1)), p1:(AND (GEQ s1 1) (GEQ s103 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][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 429 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||(p1&&G(F(p2))))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 206
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 188
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 134 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 123 transition count 160
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 123 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 123 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 121 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 121 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 119 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 119 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 118 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 118 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 118 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 117 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 117 transition count 144
Applied a total of 125 rules in 21 ms. Remains 117 /170 variables (removed 53) and now considering 144/407 (removed 263) transitions.
// Phase 1: matrix 144 rows 117 cols
[2023-03-19 18:00:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 18:00:12] [INFO ] Invariant cache hit.
[2023-03-19 18:00:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-19 18:00:12] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-19 18:00:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:00:12] [INFO ] Invariant cache hit.
[2023-03-19 18:00:12] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/170 places, 144/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 343 ms. Remains : 117/170 places, 144/407 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s112 1)), p1:(OR (LT s10 1) (LT s35 1)), p2:(OR (AND (GEQ s1 1) (GEQ s63 1)) (AND (GEQ s10 1) (GEQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 428 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((X((F(p1)&&p0)) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 204
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 132 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 132 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 120 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 120 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 113 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 111 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 109 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 109 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 108 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 108 transition count 132
Applied a total of 143 rules in 13 ms. Remains 108 /170 variables (removed 62) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 108 cols
[2023-03-19 18:00:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 18:00:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 18:00:12] [INFO ] Invariant cache hit.
[2023-03-19 18:00:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-19 18:00:12] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-19 18:00:12] [INFO ] Invariant cache hit.
[2023-03-19 18:00:12] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 132/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 108/170 places, 132/407 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s81 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(OR (AND (GEQ s1 1) (GEQ s103 1)) (AND (GEQ s1 1) (GEQ s81 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 379 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 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 14 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:00:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 18:00:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 18:00:12] [INFO ] Invariant cache hit.
[2023-03-19 18:00:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:13] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-19 18:00:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:13] [INFO ] Invariant cache hit.
[2023-03-19 18:00:13] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-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:(OR (LT s1 1) (LT s100 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 22478 reset in 102 ms.
Product exploration explored 100000 steps with 22421 reset in 109 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2535783 steps, run timeout after 3001 ms. (steps per millisecond=844 ) properties seen :{}
Probabilistic random walk after 2535783 steps, saw 1063622 distinct states, run finished after 3001 ms. (steps per millisecond=844 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:00:16] [INFO ] Invariant cache hit.
[2023-03-19 18:00:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:16] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:00:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:16] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:16] [INFO ] After 15ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:16] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-19 18:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-19 18:00:16] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 18:00:16] [INFO ] After 172ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2449019 steps, run timeout after 3001 ms. (steps per millisecond=816 ) properties seen :{}
Probabilistic random walk after 2449019 steps, saw 1026510 distinct states, run finished after 3002 ms. (steps per millisecond=815 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-19 18:00:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 18:00:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:00:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:19] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:19] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:20] [INFO ] After 18ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:20] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 18:00:20] [INFO ] After 114ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-19 18:00:20] [INFO ] Invariant cache hit.
[2023-03-19 18:00:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 18:00:20] [INFO ] Invariant cache hit.
[2023-03-19 18:00:20] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:20] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-19 18:00:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:20] [INFO ] Invariant cache hit.
[2023-03-19 18:00:20] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 4 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-19 18:00:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 18:00:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:20] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:20] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:20] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 18:00:20] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:00:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:20] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 18:00:20] [INFO ] Invariant cache hit.
[2023-03-19 18:00:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:20] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-19 18:00:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:20] [INFO ] Invariant cache hit.
[2023-03-19 18:00:20] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 2271 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2302979 steps, run timeout after 3001 ms. (steps per millisecond=767 ) properties seen :{}
Probabilistic random walk after 2302979 steps, saw 966776 distinct states, run finished after 3001 ms. (steps per millisecond=767 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:00:24] [INFO ] Invariant cache hit.
[2023-03-19 18:00:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:00:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:00:24] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:24] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:24] [INFO ] After 38ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2023-03-19 18:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-19 18:00:24] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 18:00:24] [INFO ] After 216ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2218 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 462 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2698786 steps, run timeout after 3001 ms. (steps per millisecond=899 ) properties seen :{}
Probabilistic random walk after 2698786 steps, saw 1130400 distinct states, run finished after 3001 ms. (steps per millisecond=899 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-19 18:00:27] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 18:00:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:00:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:27] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:27] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:27] [INFO ] After 23ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:27] [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 16 ms.
[2023-03-19 18:00:27] [INFO ] After 145ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-19 18:00:27] [INFO ] Invariant cache hit.
[2023-03-19 18:00:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 18:00:27] [INFO ] Invariant cache hit.
[2023-03-19 18:00:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 18:00:27] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-19 18:00:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:27] [INFO ] Invariant cache hit.
[2023-03-19 18:00:27] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 4 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-19 18:00:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 18:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:00:28] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:00:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:00:28] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:00:28] [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 11 ms.
[2023-03-19 18:00:28] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22402 reset in 168 ms.
Product exploration explored 100000 steps with 22418 reset in 211 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:00:28] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:00:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 18:00:28] [INFO ] Invariant cache hit.
[2023-03-19 18:00:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:29] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-19 18:00:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:29] [INFO ] Invariant cache hit.
[2023-03-19 18:00:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 16347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U (p2||(p1 U G(p2)))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 228
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 211
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 134 transition count 205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 123 transition count 187
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 123 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 123 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 120 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 120 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 118 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 118 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 116 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 114 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 114 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 113 transition count 164
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 113 transition count 164
Applied a total of 132 rules in 12 ms. Remains 113 /170 variables (removed 57) and now considering 164/407 (removed 243) transitions.
// Phase 1: matrix 164 rows 113 cols
[2023-03-19 18:00:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 18:00:29] [INFO ] Invariant cache hit.
[2023-03-19 18:00:29] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-19 18:00:29] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-19 18:00:29] [INFO ] Invariant cache hit.
[2023-03-19 18:00:29] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 164/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 113/170 places, 164/407 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s108 1)), p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 finished in 694 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((p0||X(F(p1)))))&&(p2||(p1 U p3)))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 152 transition count 231
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 152 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 152 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 53 place count 136 transition count 214
Iterating global reduction 1 with 16 rules applied. Total rules applied 69 place count 136 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 136 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 126 transition count 190
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 126 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 125 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 125 transition count 183
Applied a total of 104 rules in 5 ms. Remains 125 /170 variables (removed 45) and now considering 183/407 (removed 224) transitions.
// Phase 1: matrix 183 rows 125 cols
[2023-03-19 18:00:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 18:00:30] [INFO ] Invariant cache hit.
[2023-03-19 18:00:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2023-03-19 18:00:30] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-19 18:00:30] [INFO ] Invariant cache hit.
[2023-03-19 18:00:30] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/170 places, 183/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 125/170 places, 183/407 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(OR p2 p3 p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s120 1)), p3:(AND (GEQ s1 1) (GEQ s118 1)), p1:(AND (GEQ s1 1) (GEQ s119 1)), p0:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 130 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 110 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 108 transition count 133
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 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 128
Applied a total of 150 rules in 36 ms. Remains 105 /170 variables (removed 65) and now considering 128/407 (removed 279) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-19 18:00:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:00:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 18:00:30] [INFO ] Invariant cache hit.
[2023-03-19 18:00:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:31] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 18:00:31] [INFO ] Invariant cache hit.
[2023-03-19 18:00:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/170 places, 128/407 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 372 ms. Remains : 105/170 places, 128/407 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22385 reset in 183 ms.
Product exploration explored 100000 steps with 22452 reset in 170 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 314 ms. (steps per millisecond=564 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 315 ms. (steps per millisecond=562 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 18:00:32] [INFO ] Invariant cache hit.
[2023-03-19 18:00:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 18:00:32] [INFO ] Invariant cache hit.
[2023-03-19 18:00:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:32] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-19 18:00:32] [INFO ] Invariant cache hit.
[2023-03-19 18:00:32] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 202 ms. (steps per millisecond=877 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 202 ms. (steps per millisecond=877 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22430 reset in 158 ms.
Product exploration explored 100000 steps with 22410 reset in 152 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 18:00:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:00:34] [INFO ] Invariant cache hit.
[2023-03-19 18:00:34] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 105/105 places, 128/128 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-19 18:00:34] [INFO ] Invariant cache hit.
[2023-03-19 18:00:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 18:00:34] [INFO ] Invariant cache hit.
[2023-03-19 18:00:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:34] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-19 18:00:34] [INFO ] Invariant cache hit.
[2023-03-19 18:00:34] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 105/105 places, 128/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 4239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
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 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 25 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:00:35] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-19 18:00:35] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 18:00:35] [INFO ] Invariant cache hit.
[2023-03-19 18:00:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:35] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-19 18:00:35] [INFO ] Invariant cache hit.
[2023-03-19 18:00:35] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 423 ms. Remains : 105/170 places, 129/407 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22444 reset in 163 ms.
Product exploration explored 100000 steps with 22671 reset in 167 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 11 ms. (steps per millisecond=283 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 11 ms. (steps per millisecond=283 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:36] [INFO ] Invariant cache hit.
[2023-03-19 18:00:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 18:00:36] [INFO ] Invariant cache hit.
[2023-03-19 18:00:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:37] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-19 18:00:37] [INFO ] Invariant cache hit.
[2023-03-19 18:00:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 10 ms. (steps per millisecond=312 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 10 ms. (steps per millisecond=312 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22480 reset in 177 ms.
Product exploration explored 100000 steps with 22567 reset in 156 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:00:38] [INFO ] Invariant cache hit.
[2023-03-19 18:00:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 105/105 places, 129/129 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-19 18:00:38] [INFO ] Invariant cache hit.
[2023-03-19 18:00:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 18:00:38] [INFO ] Invariant cache hit.
[2023-03-19 18:00:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:00:38] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-19 18:00:38] [INFO ] Invariant cache hit.
[2023-03-19 18:00:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 3702 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)))'
[2023-03-19 18:00:38] [INFO ] Flatten gal took : 24 ms
[2023-03-19 18:00:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 18:00:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 407 transitions and 1609 arcs took 7 ms.
Total runtime 90140 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d2m36
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679248939456

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
lola: time limit : 600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 2 0 0 2 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/600 7/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 779570 m, 155914 m/sec, 1720494 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 2 0 0 2 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/600 14/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 1657917 m, 175669 m/sec, 3685717 t fired, .

Time elapsed: 10 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 2 0 0 2 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/600 21/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 2528832 m, 174183 m/sec, 5673910 t fired, .

Time elapsed: 15 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 2 0 0 2 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/600 28/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 3455622 m, 185358 m/sec, 7747572 t fired, .

Time elapsed: 20 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 2 0 0 2 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 14 (type EXCL) for 13 SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
lola: time limit : 715 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
lola: result : false
lola: markings : 1061
lola: fired transitions : 2021
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 6 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
lola: time limit : 893 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 9 (type EXCL) for 6 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
lola: time limit : 1191 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 1 0 3 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 5/1191 8/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 934460 m, 186892 m/sec, 2076730 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 1 0 3 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 10/1191 16/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 1904066 m, 193921 m/sec, 4251317 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 1 0 3 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 15/1191 23/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 2865681 m, 192323 m/sec, 6415044 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 1 0 3 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 20/1191 31/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 3808651 m, 188594 m/sec, 8551675 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 9 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 17 (type EXCL) for 16 SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
lola: time limit : 1775 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 5/1775 8/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 939938 m, 187987 m/sec, 2089211 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 10/1775 16/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 1908908 m, 193794 m/sec, 4262392 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 15/1775 23/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 2866959 m, 191610 m/sec, 6417829 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 20/1775 31/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 3805261 m, 187660 m/sec, 8544097 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 17 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
lola: time limit : 3525 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3525 8/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 934717 m, 186943 m/sec, 2077293 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3525 16/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 1900255 m, 193107 m/sec, 4242671 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3525 23/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 2850507 m, 190050 m/sec, 6381694 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3525 31/32 SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 3791331 m, 188164 m/sec, 8511549 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ 0 0 0 0 3 0 1 0
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m36-LTLFireability-00: LTL unknown AGGR
SieveSingleMsgMbox-PT-d2m36-LTLFireability-02: LTL unknown AGGR
SieveSingleMsgMbox-PT-d2m36-LTLFireability-03: CONJ unknown CONJ
SieveSingleMsgMbox-PT-d2m36-LTLFireability-04: LTL false LTL model checker
SieveSingleMsgMbox-PT-d2m36-LTLFireability-12: LTL unknown AGGR


Time elapsed: 100 secs. Pages in use: 32

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-d2m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r423-tajo-167905976800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 ;