Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282900916.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900916
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654953058523

Running Version 202205111006
[2022-06-11 13:10:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 13:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 13:10:59] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-06-11 13:10:59] [INFO ] Transformed 1295 places.
[2022-06-11 13:10:59] [INFO ] Transformed 749 transitions.
[2022-06-11 13:10:59] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 381
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 381
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 354 place count 196 transition count 376
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 385 place count 165 transition count 345
Iterating global reduction 2 with 31 rules applied. Total rules applied 416 place count 165 transition count 345
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 424 place count 165 transition count 337
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 438 place count 151 transition count 323
Iterating global reduction 3 with 14 rules applied. Total rules applied 452 place count 151 transition count 323
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 506 place count 151 transition count 269
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 509 place count 148 transition count 265
Iterating global reduction 4 with 3 rules applied. Total rules applied 512 place count 148 transition count 265
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 515 place count 145 transition count 262
Iterating global reduction 4 with 3 rules applied. Total rules applied 518 place count 145 transition count 262
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 519 place count 144 transition count 260
Iterating global reduction 4 with 1 rules applied. Total rules applied 520 place count 144 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 143 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 143 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 523 place count 142 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 524 place count 142 transition count 258
Applied a total of 524 rules in 79 ms. Remains 142 /259 variables (removed 117) and now considering 258/749 (removed 491) transitions.
// Phase 1: matrix 258 rows 142 cols
[2022-06-11 13:11:00] [INFO ] Computed 5 place invariants in 21 ms
[2022-06-11 13:11:00] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 258 rows 142 cols
[2022-06-11 13:11:00] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 13:11:00] [INFO ] State equation strengthened by 158 read => feed constraints.
[2022-06-11 13:11:00] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 258 rows 142 cols
[2022-06-11 13:11:00] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 13:11:00] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/259 places, 258/749 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/259 places, 258/749 transitions.
Support contains 24 out of 142 places after structural reductions.
[2022-06-11 13:11:01] [INFO ] Flatten gal took : 44 ms
[2022-06-11 13:11:01] [INFO ] Flatten gal took : 20 ms
[2022-06-11 13:11:01] [INFO ] Input system was already deterministic with 258 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 306140 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{2=1, 3=1, 5=1, 6=1, 9=1, 10=1, 11=1, 12=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 22=1}
Probabilistic random walk after 306140 steps, saw 138978 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :16
Running SMT prover for 8 properties.
// Phase 1: matrix 258 rows 142 cols
[2022-06-11 13:11:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:11:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:11:05] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2022-06-11 13:11:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:11:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 13:11:05] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-06-11 13:11:05] [INFO ] State equation strengthened by 158 read => feed constraints.
[2022-06-11 13:11:05] [INFO ] After 255ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2022-06-11 13:11:06] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 5 ms to minimize.
[2022-06-11 13:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-06-11 13:11:06] [INFO ] After 638ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 253 ms.
[2022-06-11 13:11:06] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 258/258 transitions.
Graph (complete) has 481 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 141 transition count 256
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 130 transition count 187
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 130 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 130 transition count 184
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 37 place count 121 transition count 175
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 121 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 121 transition count 170
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 58 place count 114 transition count 162
Iterating global reduction 3 with 7 rules applied. Total rules applied 65 place count 114 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 114 transition count 159
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 112 transition count 156
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 112 transition count 156
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 110 transition count 154
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 110 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 108 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 108 transition count 152
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 85 place count 108 transition count 147
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 87 place count 106 transition count 145
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 106 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 105 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 105 transition count 144
Applied a total of 91 rules in 67 ms. Remains 105 /142 variables (removed 37) and now considering 144/258 (removed 114) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/142 places, 144/258 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 364168 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364168 steps, saw 159130 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 144 rows 105 cols
[2022-06-11 13:11:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 13:11:10] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 13:11:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:10] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 13:11:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 13:11:10] [INFO ] After 119ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 13:11:10] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-06-11 13:11:11] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 81 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 144/144 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 101 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 101 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 94 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 94 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 93 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 93 transition count 130
Applied a total of 24 rules in 39 ms. Remains 93 /105 variables (removed 12) and now considering 130/144 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 130/144 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 500094 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500094 steps, saw 219264 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 130 rows 93 cols
[2022-06-11 13:11:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-11 13:11:14] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 13:11:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:15] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 13:11:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-11 13:11:15] [INFO ] After 81ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 13:11:15] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-06-11 13:11:15] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 82 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 10 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 130/130 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 93 cols
[2022-06-11 13:11:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:11:15] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 130 rows 93 cols
[2022-06-11 13:11:15] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 13:11:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-11 13:11:15] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2022-06-11 13:11:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 130 rows 93 cols
[2022-06-11 13:11:15] [INFO ] Computed 4 place invariants in 13 ms
[2022-06-11 13:11:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 130/130 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 111
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 111
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 67 transition count 103
Applied a total of 53 rules in 15 ms. Remains 67 /93 variables (removed 26) and now considering 103/130 (removed 27) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 103 rows 67 cols
[2022-06-11 13:11:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:11:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 13:11:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:15] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 13:11:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:11:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:11:15] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 13:11:16] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-11 13:11:16] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-11 13:11:16] [INFO ] Flatten gal took : 8 ms
[2022-06-11 13:11:16] [INFO ] Flatten gal took : 6 ms
[2022-06-11 13:11:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3806445583053115629.gal : 4 ms
[2022-06-11 13:11:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6663881330032746893.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5727244199763009787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3806445583053115629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6663881330032746893.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6663881330032746893.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 39
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :39 after 149
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :149 after 233
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :233 after 338
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :338 after 1069
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1069 after 2539
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2539 after 20467
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :20467 after 141071
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :141071 after 3.74085e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.74085e+06 after 5.49707e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.49707e+07 after 1.22144e+09
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.22144e+09 after 8.33673e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.23346e+10,14.2558,293808,2,11625,19,1.21276e+06,10,0,372,1.22685e+06,0
Total reachable state count : 22334637745

Verifying 4 reachability properties.
Reachability property AtomicPropp0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp0,1.91602e+06,14.2574,293808,2,571,19,1.21276e+06,10,0,375,1.22685e+06,0
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,1.91602e+06,14.2582,293808,2,571,19,1.21276e+06,10,0,376,1.22685e+06,0
Reachability property AtomicPropp21 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp21,1.91602e+06,14.2589,293808,2,571,19,1.21276e+06,10,0,377,1.22685e+06,0
Reachability property AtomicPropp23 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp23,1.91602e+06,14.2594,293808,2,571,19,1.21276e+06,10,0,378,1.22685e+06,0
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 40 stable transitions
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 114 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 114 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 114 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 103 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 103 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 99 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 99 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 95 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 84 transition count 98
Applied a total of 131 rules in 13 ms. Remains 84 /142 variables (removed 58) and now considering 98/258 (removed 160) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:31] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:11:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/142 places, 98/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/142 places, 98/258 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22405 reset in 234 ms.
Product exploration explored 100000 steps with 22435 reset in 141 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 39 ms. (steps per millisecond=926 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 40 ms. (steps per millisecond=903 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:32] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:11:33] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:33] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 58 ms. (steps per millisecond=622 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 58 ms. (steps per millisecond=622 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22314 reset in 106 ms.
Product exploration explored 100000 steps with 22518 reset in 151 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 10 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2022-06-11 13:11:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Product exploration explored 100000 steps with 22405 reset in 192 ms.
Product exploration explored 100000 steps with 22425 reset in 204 ms.
Built C files in :
/tmp/ltsmin11025412491051428273
[2022-06-11 13:11:35] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11025412491051428273
Running compilation step : cd /tmp/ltsmin11025412491051428273;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin11025412491051428273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11025412491051428273;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2933987048636714552.hoa' '--buchi-type=spotba'
LTSmin run took 1269 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 5548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(p0))) U (p1 U p0))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 128 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 128 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 128 transition count 160
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 115 transition count 147
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 115 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 115 transition count 140
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 73 place count 104 transition count 128
Iterating global reduction 2 with 11 rules applied. Total rules applied 84 place count 104 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 100 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 100 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 96 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 96 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 93 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 93 transition count 109
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 90 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 90 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 88 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 85 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 85 transition count 100
Applied a total of 128 rules in 19 ms. Remains 85 /142 variables (removed 57) and now considering 100/258 (removed 158) transitions.
// Phase 1: matrix 100 rows 85 cols
[2022-06-11 13:11:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:36] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 100 rows 85 cols
[2022-06-11 13:11:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 13:11:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 85 cols
[2022-06-11 13:11:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/142 places, 100/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/142 places, 100/258 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 153
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 127 transition count 150
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 114 transition count 137
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 114 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 114 transition count 129
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 104 transition count 118
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 104 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 104 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 100 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 100 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 96 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 96 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 93 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 93 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 93 transition count 99
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 119 place count 90 transition count 96
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 89 transition count 95
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 89 transition count 95
Applied a total of 124 rules in 39 ms. Remains 89 /142 variables (removed 53) and now considering 95/258 (removed 163) transitions.
// Phase 1: matrix 95 rows 89 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:37] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 95 rows 89 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 13:11:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-06-11 13:11:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 95 rows 89 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 13:11:37] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/142 places, 95/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/142 places, 95/258 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(((F(p1)&&(X(p2)||p3))||p3))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 130 transition count 180
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 130 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 130 transition count 179
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 119 transition count 168
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 119 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 52 place count 119 transition count 163
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 110 transition count 153
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 110 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 110 transition count 151
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 108 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 108 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 106 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 106 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 104 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 104 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 102 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 102 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 100 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 100 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 99 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 99 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 98 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 98 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 97 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 97 transition count 135
Applied a total of 98 rules in 16 ms. Remains 97 /142 variables (removed 45) and now considering 135/258 (removed 123) transitions.
// Phase 1: matrix 135 rows 97 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 135 rows 97 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 13:11:37] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-11 13:11:37] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 135 rows 97 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/142 places, 135/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/142 places, 135/258 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s90 1)), p1:(AND (GEQ s1 1) (GEQ s91 1)), p0:(AND (GEQ s1 1) (GEQ s93 1)), p2:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 152
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 127 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 113 transition count 137
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 113 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 113 transition count 129
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 79 place count 101 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 91 place count 101 transition count 116
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 101 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 96 transition count 104
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 96 transition count 104
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 111 place count 91 transition count 99
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 91 transition count 99
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 87 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 87 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 83 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 83 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 81 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 78 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 78 transition count 83
Applied a total of 144 rules in 32 ms. Remains 78 /142 variables (removed 64) and now considering 83/258 (removed 175) transitions.
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:37] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 13:11:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-11 13:11:38] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-11 13:11:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 83 rows 78 cols
[2022-06-11 13:11:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/142 places, 83/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/142 places, 83/258 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 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 s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G((p1 U p2))&&p3))||p0)))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 128 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 128 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 128 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 116 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 116 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 116 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 108 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 108 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 106 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 106 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 104 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 104 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 102 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 102 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 100 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 100 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 98 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 98 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 97 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 97 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 96 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 96 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 95 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 95 transition count 115
Applied a total of 104 rules in 12 ms. Remains 95 /142 variables (removed 47) and now considering 115/258 (removed 143) transitions.
// Phase 1: matrix 115 rows 95 cols
[2022-06-11 13:11:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:38] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 115 rows 95 cols
[2022-06-11 13:11:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-11 13:11:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 95 cols
[2022-06-11 13:11:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/142 places, 115/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/142 places, 115/258 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s89 1)), p3:(OR (LT s1 1) (LT s67 1)), p2:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1))))), (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) p1))), (X (X (NOT (OR p2 p1)))), (X (X (OR (NOT p3) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p3 p2) (AND p3 p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1))))
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 1215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))||(F(p1) U (p1 U p2))))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 128 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 128 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 128 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 116 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 116 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 116 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 107 transition count 130
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 107 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 107 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 104 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 104 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 101 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 101 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 99 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 99 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 99 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 97 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 97 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 96 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 96 transition count 112
Applied a total of 108 rules in 6 ms. Remains 96 /142 variables (removed 46) and now considering 112/258 (removed 146) transitions.
// Phase 1: matrix 112 rows 96 cols
[2022-06-11 13:11:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:11:39] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 112 rows 96 cols
[2022-06-11 13:11:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 13:11:39] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 96 cols
[2022-06-11 13:11:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/142 places, 112/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/142 places, 112/258 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 545 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G((p0 U (G((p0 U p1)) U X(p0))))))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 114 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 114 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 114 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 103 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 103 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 99 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 99 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 95 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 84 transition count 98
Applied a total of 131 rules in 7 ms. Remains 84 /142 variables (removed 58) and now considering 98/258 (removed 160) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:40] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:11:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/142 places, 98/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/142 places, 98/258 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=p0, acceptance={1} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 5}, { cond=(OR p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s79 1)), p0:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(p0)))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 114 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 114 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 114 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 103 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 103 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 99 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 99 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 95 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 84 transition count 98
Applied a total of 131 rules in 17 ms. Remains 84 /142 variables (removed 58) and now considering 98/258 (removed 160) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:40] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:11:40] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-11 13:11:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:11:40] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/142 places, 98/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/142 places, 98/258 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-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 s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 258/258 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 114 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 114 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 114 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 103 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 103 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 99 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 96 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 94 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 94 transition count 111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 92 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 92 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 90 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 89 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 89 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 88 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 87 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 87 transition count 103
Applied a total of 123 rules in 22 ms. Remains 87 /142 variables (removed 55) and now considering 103/258 (removed 155) transitions.
// Phase 1: matrix 103 rows 87 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:40] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 87 cols
[2022-06-11 13:11:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:11:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 13:11:41] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-06-11 13:11:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 87 cols
[2022-06-11 13:11:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:11:41] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/142 places, 103/258 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/142 places, 103/258 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s26 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 finished in 364 ms.
All properties solved by simple procedures.
Total runtime 41638 ms.

BK_STOP 1654953101356

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r312-tall-165472282900916"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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