Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 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-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679320941842

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 14:02:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 14:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:02:24] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-20 14:02:24] [INFO ] Transformed 2398 places.
[2023-03-20 14:02:24] [INFO ] Transformed 1954 transitions.
[2023-03-20 14:02:24] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 14 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 692
Iterating global reduction 1 with 99 rules applied. Total rules applied 1051 place count 290 transition count 692
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1061 place count 290 transition count 682
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 1134 place count 217 transition count 609
Iterating global reduction 2 with 73 rules applied. Total rules applied 1207 place count 217 transition count 609
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1241 place count 217 transition count 575
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1267 place count 191 transition count 545
Iterating global reduction 3 with 26 rules applied. Total rules applied 1293 place count 191 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 1379 place count 191 transition count 459
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1385 place count 185 transition count 449
Iterating global reduction 4 with 6 rules applied. Total rules applied 1391 place count 185 transition count 449
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1397 place count 179 transition count 443
Iterating global reduction 4 with 6 rules applied. Total rules applied 1403 place count 179 transition count 443
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1406 place count 176 transition count 439
Iterating global reduction 4 with 3 rules applied. Total rules applied 1409 place count 176 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1410 place count 175 transition count 438
Iterating global reduction 4 with 1 rules applied. Total rules applied 1411 place count 175 transition count 438
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1412 place count 174 transition count 437
Iterating global reduction 4 with 1 rules applied. Total rules applied 1413 place count 174 transition count 437
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 173 transition count 436
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 173 transition count 436
Applied a total of 1415 rules in 150 ms. Remains 173 /414 variables (removed 241) and now considering 436/1954 (removed 1518) transitions.
// Phase 1: matrix 436 rows 173 cols
[2023-03-20 14:02:24] [INFO ] Computed 5 place invariants in 20 ms
[2023-03-20 14:02:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-20 14:02:25] [INFO ] Invariant cache hit.
[2023-03-20 14:02:25] [INFO ] State equation strengthened by 302 read => feed constraints.
[2023-03-20 14:02:26] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2023-03-20 14:02:26] [INFO ] Invariant cache hit.
[2023-03-20 14:02:26] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/414 places, 436/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1858 ms. Remains : 173/414 places, 436/1954 transitions.
Support contains 24 out of 173 places after structural reductions.
[2023-03-20 14:02:26] [INFO ] Flatten gal took : 125 ms
[2023-03-20 14:02:26] [INFO ] Flatten gal took : 60 ms
[2023-03-20 14:02:27] [INFO ] Input system was already deterministic with 436 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 152212 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{0=1, 1=1, 6=1, 7=1, 11=1, 14=1, 15=1, 16=1, 17=1, 21=1, 24=1}
Probabilistic random walk after 152212 steps, saw 70765 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :11
Running SMT prover for 14 properties.
[2023-03-20 14:02:31] [INFO ] Invariant cache hit.
[2023-03-20 14:02:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 14:02:32] [INFO ] After 963ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:11
[2023-03-20 14:02:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 14:02:33] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-20 14:02:33] [INFO ] State equation strengthened by 302 read => feed constraints.
[2023-03-20 14:02:34] [INFO ] After 859ms SMT Verify possible using 302 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-03-20 14:02:35] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 8 ms to minimize.
[2023-03-20 14:02:35] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2023-03-20 14:02:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-20 14:02:35] [INFO ] After 2262ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-20 14:02:36] [INFO ] After 3954ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 10 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 436/436 transitions.
Graph (complete) has 705 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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 172 transition count 434
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 160 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 160 transition count 300
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 148 transition count 288
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 148 transition count 288
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 148 transition count 281
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 140 transition count 267
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 140 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 140 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 137 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 137 transition count 259
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 134 transition count 256
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 134 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 133 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 133 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 102 place count 133 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 132 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 132 transition count 245
Applied a total of 104 rules in 86 ms. Remains 132 /173 variables (removed 41) and now considering 245/436 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 132/173 places, 245/436 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 414297 steps, run timeout after 3004 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 414297 steps, saw 179550 distinct states, run finished after 3011 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 245 rows 132 cols
[2023-03-20 14:02:40] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-20 14:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:40] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 14:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:41] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 14:02:41] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-20 14:02:42] [INFO ] After 699ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 14:02:42] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2023-03-20 14:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-20 14:02:43] [INFO ] After 1932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 959 ms.
[2023-03-20 14:02:44] [INFO ] After 3337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 318 ms.
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 132/132 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-20 14:02:44] [INFO ] Invariant cache hit.
[2023-03-20 14:02:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-20 14:02:44] [INFO ] Invariant cache hit.
[2023-03-20 14:02:44] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-20 14:02:45] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-20 14:02:45] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-20 14:02:45] [INFO ] Invariant cache hit.
[2023-03-20 14:02:45] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 923 ms. Remains : 132/132 places, 245/245 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 132 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 126 transition count 238
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 126 transition count 221
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 109 transition count 221
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 100 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 99 transition count 221
Applied a total of 67 rules in 39 ms. Remains 99 /132 variables (removed 33) and now considering 221/245 (removed 24) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 221 rows 99 cols
[2023-03-20 14:02:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:02:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:46] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 14:02:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:46] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 14:02:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-20 14:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-20 14:02:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2023-03-20 14:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-20 14:02:46] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-20 14:02:47] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 59 stable transitions
Graph (complete) has 768 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&F(p2)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 224
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 206
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 137 transition count 198
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 126 transition count 178
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 126 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 126 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 123 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 120 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 120 transition count 165
Applied a total of 121 rules in 42 ms. Remains 120 /173 variables (removed 53) and now considering 165/436 (removed 271) transitions.
// Phase 1: matrix 165 rows 120 cols
[2023-03-20 14:02:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:02:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-20 14:02:47] [INFO ] Invariant cache hit.
[2023-03-20 14:02:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-20 14:02:48] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-20 14:02:48] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 14:02:48] [INFO ] Invariant cache hit.
[2023-03-20 14:02:48] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/173 places, 165/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 695 ms. Remains : 120/173 places, 165/436 transitions.
Stuttering acceptance computed with spot in 485 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (LT s1 1) (LT s114 1)), p2:(AND (GEQ s1 1) (GEQ s62 1)), p0:(AND (GEQ s1 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)||X(p2)) U (p3 U X(p0)))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 156 transition count 248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 156 transition count 248
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 139 transition count 231
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 139 transition count 231
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 139 transition count 221
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 88 place count 129 transition count 204
Iterating global reduction 1 with 10 rules applied. Total rules applied 98 place count 129 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 129 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 126 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 126 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 123 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 123 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 122 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 121 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 120 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 120 transition count 187
Applied a total of 122 rules in 25 ms. Remains 120 /173 variables (removed 53) and now considering 187/436 (removed 249) transitions.
// Phase 1: matrix 187 rows 120 cols
[2023-03-20 14:02:48] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 14:02:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 14:02:48] [INFO ] Invariant cache hit.
[2023-03-20 14:02:49] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-20 14:02:49] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-20 14:02:49] [INFO ] Invariant cache hit.
[2023-03-20 14:02:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/173 places, 187/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 120/173 places, 187/436 transitions.
Stuttering acceptance computed with spot in 771 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 3}]], initial=4, aps=[p3:(AND (GEQ s1 1) (GEQ s114 1)), p1:(AND (GEQ s1 1) (GEQ s113 1)), p0:(AND (GEQ s1 1) (GEQ s112 1)), p2:(AND (GEQ s1 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 1582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 133 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 120 transition count 157
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 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 124 place count 120 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 115 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 115 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 110 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 108 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 106 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 129
Applied a total of 156 rules in 27 ms. Remains 105 /173 variables (removed 68) and now considering 129/436 (removed 307) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 14:02:50] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 14:02:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-20 14:02:50] [INFO ] Invariant cache hit.
[2023-03-20 14:02:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 14:02:50] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-20 14:02:50] [INFO ] Invariant cache hit.
[2023-03-20 14:02:50] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/173 places, 129/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 105/173 places, 129/436 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s100 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]]
Product exploration explored 100000 steps with 33333 reset in 306 ms.
Product exploration explored 100000 steps with 33333 reset in 218 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.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 1283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 222
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 203
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 194
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 173
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 113 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 111 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 110 transition count 147
Applied a total of 146 rules in 24 ms. Remains 110 /173 variables (removed 63) and now considering 147/436 (removed 289) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:02:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:02:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 14:02:51] [INFO ] Invariant cache hit.
[2023-03-20 14:02:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:02:52] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-20 14:02:52] [INFO ] Invariant cache hit.
[2023-03-20 14:02:52] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/173 places, 147/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 110/173 places, 147/436 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s104 1)), p2:(OR (LT s27 1) (LT s32 1)), p1:(OR (LT s1 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37344 reset in 306 ms.
Product exploration explored 100000 steps with 37318 reset in 249 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 489 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1073 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 434 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 570210 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{1=1}
Probabilistic random walk after 570210 steps, saw 242295 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :1
Running SMT prover for 3 properties.
[2023-03-20 14:02:56] [INFO ] Invariant cache hit.
[2023-03-20 14:02:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:02:57] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 14:02:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 14:02:57] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 14:02:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:02:57] [INFO ] After 101ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-20 14:02:57] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-20 14:02:57] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 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 109 transition count 145
Applied a total of 3 rules in 7 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 836938 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 836938 steps, saw 354486 distinct states, run finished after 3005 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-20 14:03:00] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:03:00] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:03:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:03:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:01] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:01] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:01] [INFO ] After 61ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:01] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-20 14:03:01] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-20 14:03:01] [INFO ] Invariant cache hit.
[2023-03-20 14:03:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-20 14:03:01] [INFO ] Invariant cache hit.
[2023-03-20 14:03:01] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:01] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-20 14:03:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:01] [INFO ] Invariant cache hit.
[2023-03-20 14:03:01] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 109/109 places, 145/145 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 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
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 103 transition count 121
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 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
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 63 place count 78 transition count 123
Applied a total of 63 rules in 11 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-20 14:03:01] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 14:03:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:01] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:03:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 14:03:01] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:01] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2023-03-20 14:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 14:03:02] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 14:03:02] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 548 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:03:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-20 14:03:03] [INFO ] Invariant cache hit.
[2023-03-20 14:03:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:03] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-20 14:03:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:03] [INFO ] Invariant cache hit.
[2023-03-20 14:03:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 110/110 places, 147/147 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 819426 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{1=1}
Probabilistic random walk after 819426 steps, saw 347188 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-20 14:03:07] [INFO ] Invariant cache hit.
[2023-03-20 14:03:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:03:07] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:07] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:07] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:07] [INFO ] After 37ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2023-03-20 14:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-20 14:03:07] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 14:03:07] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 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 109 transition count 145
Applied a total of 3 rules in 8 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 840390 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 840390 steps, saw 355963 distinct states, run finished after 3002 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-20 14:03:10] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 14:03:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:10] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:11] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:11] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:11] [INFO ] After 38ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2023-03-20 14:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-20 14:03:11] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 14:03:11] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-20 14:03:11] [INFO ] Invariant cache hit.
[2023-03-20 14:03:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 14:03:11] [INFO ] Invariant cache hit.
[2023-03-20 14:03:11] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:11] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-20 14:03:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:11] [INFO ] Invariant cache hit.
[2023-03-20 14:03:11] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 109/109 places, 145/145 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 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
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 103 transition count 121
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 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
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 63 place count 78 transition count 123
Applied a total of 63 rules in 9 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-20 14:03:11] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:03:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:11] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:11] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:11] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 14:03:11] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 37380 reset in 258 ms.
Product exploration explored 100000 steps with 37268 reset in 229 ms.
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:03:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:03:13] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 14:03:13] [INFO ] Invariant cache hit.
[2023-03-20 14:03:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:13] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-20 14:03:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 14:03:13] [INFO ] Invariant cache hit.
[2023-03-20 14:03:13] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 546 ms. Remains : 110/110 places, 147/147 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 22309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 90 place count 133 transition count 179
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 120 transition count 156
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 120 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 125 place count 120 transition count 147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 115 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 115 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 110 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 108 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 151 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 106 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 105 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 105 transition count 128
Applied a total of 157 rules in 27 ms. Remains 105 /173 variables (removed 68) and now considering 128/436 (removed 308) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-20 14:03:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 14:03:14] [INFO ] Invariant cache hit.
[2023-03-20 14:03:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 14:03:14] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 14:03:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:14] [INFO ] Invariant cache hit.
[2023-03-20 14:03:14] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/173 places, 128/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 105/173 places, 128/436 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 192
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 192
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 114 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 114 transition count 144
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 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 113 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 113 transition count 141
Applied a total of 139 rules in 23 ms. Remains 113 /173 variables (removed 60) and now considering 141/436 (removed 295) transitions.
// Phase 1: matrix 141 rows 113 cols
[2023-03-20 14:03:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 14:03:14] [INFO ] Invariant cache hit.
[2023-03-20 14:03:14] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-20 14:03:14] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 14:03:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 14:03:14] [INFO ] Invariant cache hit.
[2023-03-20 14:03:14] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 141/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 113/173 places, 141/436 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s1 1) (GEQ s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (F(p1) U (G(p3)&&p2)))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 235
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 235
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 217
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 217
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 137 transition count 209
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 126 transition count 190
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 126 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 126 transition count 183
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 122 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 122 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 118 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 118 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 116 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 114 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 114 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 113 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 113 transition count 164
Applied a total of 139 rules in 26 ms. Remains 113 /173 variables (removed 60) and now considering 164/436 (removed 272) transitions.
// Phase 1: matrix 164 rows 113 cols
[2023-03-20 14:03:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 14:03:14] [INFO ] Invariant cache hit.
[2023-03-20 14:03:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-20 14:03:15] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-20 14:03:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:15] [INFO ] Invariant cache hit.
[2023-03-20 14:03:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 164/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 113/173 places, 164/436 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p3 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={0} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s106 1)), p1:(AND (GEQ s1 1) (GEQ s108 1)), p0:(AND (GEQ s1 1) (GEQ s107 1)), p3:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 133 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 120 transition count 157
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 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 124 place count 120 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 115 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 115 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 110 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 108 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 106 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 129
Applied a total of 156 rules in 23 ms. Remains 105 /173 variables (removed 68) and now considering 129/436 (removed 307) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 14:03:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-20 14:03:15] [INFO ] Invariant cache hit.
[2023-03-20 14:03:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 14:03:16] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-20 14:03:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 14:03:16] [INFO ] Invariant cache hit.
[2023-03-20 14:03:16] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/173 places, 129/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 105/173 places, 129/436 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 222
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 203
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 194
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 173
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 113 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 111 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 110 transition count 147
Applied a total of 146 rules in 23 ms. Remains 110 /173 variables (removed 63) and now considering 147/436 (removed 289) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:03:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 14:03:16] [INFO ] Invariant cache hit.
[2023-03-20 14:03:16] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-20 14:03:16] [INFO ] Invariant cache hit.
[2023-03-20 14:03:17] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 110/173 places, 147/436 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 484 ms. Remains : 110/173 places, 147/436 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s104 1)), p2:(OR (LT s27 1) (LT s32 1)), p1:(OR (LT s1 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37348 reset in 203 ms.
Product exploration explored 100000 steps with 37184 reset in 194 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 668031 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{1=1}
Probabilistic random walk after 668031 steps, saw 284622 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :1
Running SMT prover for 3 properties.
[2023-03-20 14:03:21] [INFO ] Invariant cache hit.
[2023-03-20 14:03:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:21] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 14:03:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 14:03:21] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 14:03:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:21] [INFO ] After 64ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-20 14:03:21] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 14:03:22] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 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 109 transition count 145
Applied a total of 3 rules in 5 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 866381 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 866381 steps, saw 366576 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-20 14:03:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 14:03:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 14:03:25] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 14:03:25] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:25] [INFO ] After 64ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:25] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-20 14:03:25] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 58 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-20 14:03:25] [INFO ] Invariant cache hit.
[2023-03-20 14:03:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 14:03:25] [INFO ] Invariant cache hit.
[2023-03-20 14:03:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:26] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-20 14:03:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 14:03:26] [INFO ] Invariant cache hit.
[2023-03-20 14:03:26] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 109/109 places, 145/145 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 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
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 103 transition count 121
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 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
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 63 place count 78 transition count 123
Applied a total of 63 rules in 8 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-20 14:03:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 14:03:26] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 14:03:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:26] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:26] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-20 14:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-20 14:03:26] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 14:03:26] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 366 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:03:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 14:03:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 14:03:27] [INFO ] Invariant cache hit.
[2023-03-20 14:03:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:27] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-20 14:03:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:27] [INFO ] Invariant cache hit.
[2023-03-20 14:03:27] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 110/110 places, 147/147 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 258 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 625105 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{1=1}
Probabilistic random walk after 625105 steps, saw 266493 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-20 14:03:31] [INFO ] Invariant cache hit.
[2023-03-20 14:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:03:31] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:31] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:31] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:31] [INFO ] After 37ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-20 14:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-20 14:03:31] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 14:03:31] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 109 transition count 145
Applied a total of 3 rules in 8 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 957490 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 957490 steps, saw 402906 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-20 14:03:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 14:03:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:35] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 14:03:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:35] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:35] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:35] [INFO ] After 32ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2023-03-20 14:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 14:03:35] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-20 14:03:35] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-20 14:03:35] [INFO ] Invariant cache hit.
[2023-03-20 14:03:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 14:03:35] [INFO ] Invariant cache hit.
[2023-03-20 14:03:35] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 14:03:35] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-20 14:03:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:35] [INFO ] Invariant cache hit.
[2023-03-20 14:03:35] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 109/109 places, 145/145 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 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
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 103 transition count 121
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 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
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 63 place count 78 transition count 123
Applied a total of 63 rules in 10 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-20 14:03:35] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 14:03:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 14:03:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:03:35] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 14:03:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:03:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:03:35] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 14:03:36] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 14:03:36] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 37282 reset in 214 ms.
Product exploration explored 100000 steps with 37345 reset in 210 ms.
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-20 14:03:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:03:37] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 14:03:37] [INFO ] Invariant cache hit.
[2023-03-20 14:03:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-20 14:03:37] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-20 14:03:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:03:37] [INFO ] Invariant cache hit.
[2023-03-20 14:03:37] [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 474 ms. Remains : 110/110 places, 147/147 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 21655 ms.
[2023-03-20 14:03:37] [INFO ] Flatten gal took : 28 ms
[2023-03-20 14:03:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 14:03:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 436 transitions and 1723 arcs took 6 ms.
Total runtime 73800 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1484/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10

BK_STOP 1679321018422

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
ltl formula formula --ltl=/tmp/1484/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 173 places, 436 transitions and 1723 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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