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-165472282900900.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-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:05 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-d1m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654951164679

Running Version 202205111006
[2022-06-11 12:39:25] [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 12:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:39:26] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-06-11 12:39:26] [INFO ] Transformed 1295 places.
[2022-06-11 12:39:26] [INFO ] Transformed 749 transitions.
[2022-06-11 12:39:26] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 236 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 2 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 302 place count 197 transition count 373
Iterating global reduction 1 with 45 rules applied. Total rules applied 347 place count 197 transition count 373
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 355 place count 197 transition count 365
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 383 place count 169 transition count 337
Iterating global reduction 2 with 28 rules applied. Total rules applied 411 place count 169 transition count 337
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 417 place count 169 transition count 331
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 432 place count 154 transition count 314
Iterating global reduction 3 with 15 rules applied. Total rules applied 447 place count 154 transition count 314
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 475 place count 154 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 476 place count 153 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 477 place count 153 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 478 place count 152 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 479 place count 152 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 480 place count 151 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 481 place count 151 transition count 282
Applied a total of 481 rules in 68 ms. Remains 151 /259 variables (removed 108) and now considering 282/749 (removed 467) transitions.
// Phase 1: matrix 282 rows 151 cols
[2022-06-11 12:39:26] [INFO ] Computed 5 place invariants in 21 ms
[2022-06-11 12:39:26] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 282 rows 151 cols
[2022-06-11 12:39:26] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 12:39:26] [INFO ] State equation strengthened by 176 read => feed constraints.
[2022-06-11 12:39:27] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 151 cols
[2022-06-11 12:39:27] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 12:39:27] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/259 places, 282/749 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/259 places, 282/749 transitions.
Support contains 27 out of 151 places after structural reductions.
[2022-06-11 12:39:27] [INFO ] Flatten gal took : 48 ms
[2022-06-11 12:39:27] [INFO ] Flatten gal took : 23 ms
[2022-06-11 12:39:27] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 111 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 282 rows 151 cols
[2022-06-11 12:39:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2022-06-11 12:39:29] [INFO ] After 1131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2022-06-11 12:39:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:39:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 12:39:30] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2022-06-11 12:39:30] [INFO ] State equation strengthened by 176 read => feed constraints.
[2022-06-11 12:39:32] [INFO ] After 1427ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2022-06-11 12:39:32] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
[2022-06-11 12:39:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-11 12:39:33] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 2 ms to minimize.
[2022-06-11 12:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-06-11 12:39:34] [INFO ] After 3717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 2157 ms.
[2022-06-11 12:39:36] [INFO ] After 6955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 1 properties in 766 ms.
Support contains 23 out of 151 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 151/151 places, 282/282 transitions.
Graph (complete) has 521 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 150 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 148 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 148 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 148 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 147 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 147 transition count 276
Applied a total of 10 rules in 49 ms. Remains 147 /151 variables (removed 4) and now considering 276/282 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/151 places, 276/282 transitions.
Incomplete random walk after 10000 steps, including 2188 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Finished probabilistic random walk after 497075 steps, run visited all 25 properties in 1971 ms. (steps per millisecond=252 )
Probabilistic random walk after 497075 steps, saw 184936 distinct states, run finished after 1971 ms. (steps per millisecond=252 ) properties seen :25
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 42 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U p1)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 173
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 171
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 117 transition count 155
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 117 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 117 transition count 146
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 106 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 106 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 106 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 114 place count 101 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 119 place count 101 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 97 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 97 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 95 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 95 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 94 transition count 111
Applied a total of 135 rules in 31 ms. Remains 94 /151 variables (removed 57) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:40] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 12:39:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-06-11 12:39:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:40] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/151 places, 111/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/151 places, 111/282 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s29 1)), p0:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 finished in 801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 181
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 117 transition count 165
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 117 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 117 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 106 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 106 transition count 143
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 106 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 101 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 91 transition count 117
Applied a total of 140 rules in 17 ms. Remains 91 /151 variables (removed 60) and now considering 117/282 (removed 165) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 12:39:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:41] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 12:39:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 12:39:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 12:39:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/151 places, 117/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/151 places, 117/282 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s85 1)), p0:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 333 ms.
Product exploration explored 100000 steps with 50000 reset in 250 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 finished in 1202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 161
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 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 42 place count 131 transition count 159
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 113 transition count 141
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 113 transition count 141
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 89 place count 113 transition count 130
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 100 transition count 115
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 100 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 122 place count 100 transition count 108
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 93 transition count 100
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 93 transition count 100
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 142 place count 87 transition count 94
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 87 transition count 94
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 83 transition count 90
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 83 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 77 transition count 81
Applied a total of 170 rules in 17 ms. Remains 77 /151 variables (removed 74) and now considering 81/282 (removed 201) transitions.
// Phase 1: matrix 81 rows 77 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:42] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 81 rows 77 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-11 12:39:42] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 77 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:42] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/151 places, 81/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/151 places, 81/282 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s23 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][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p1)||p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 173
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 171
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 117 transition count 155
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 117 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 117 transition count 146
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 106 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 106 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 106 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 114 place count 101 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 119 place count 101 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 97 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 97 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 95 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 95 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 94 transition count 111
Applied a total of 135 rules in 18 ms. Remains 94 /151 variables (removed 57) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:42] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 12:39:42] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 94 cols
[2022-06-11 12:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 111/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/151 places, 111/282 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s89 1)), p1:(AND (GEQ s10 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 19 stabilizing places and 21 stable transitions
Computed a total of 19 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 finished in 813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)||F(X((F(p2)&&p3)))||p0))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 161
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 117 transition count 145
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 117 transition count 145
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 80 place count 117 transition count 135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 106 transition count 123
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 106 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 106 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 102 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 99 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 98 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 98 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 97 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 97 transition count 107
Applied a total of 127 rules in 23 ms. Remains 97 /151 variables (removed 54) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 97 cols
[2022-06-11 12:39:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:43] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 107 rows 97 cols
[2022-06-11 12:39:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:39:43] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 97 cols
[2022-06-11 12:39:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/151 places, 107/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/151 places, 107/282 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s88 1)), p1:(OR (LT s10 1) (LT s29 1)), p3:(OR (LT s1 1) (LT s70 1)), p2:(OR (LT s1 1) (LT s88 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]]
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Computed a total of 28 stabilizing places and 33 stable transitions
Computed a total of 28 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 45 ms. Reduced automaton from 5 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 finished in 856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 132 transition count 170
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 115 transition count 153
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 115 transition count 153
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 84 place count 115 transition count 143
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 103 transition count 129
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 103 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 103 transition count 121
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 97 transition count 114
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 97 transition count 114
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 92 transition count 109
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 84 transition count 98
Applied a total of 156 rules in 29 ms. Remains 84 /151 variables (removed 67) and now considering 98/282 (removed 184) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:39:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:44] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:39:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:39:44] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-06-11 12:39:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:39:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:44] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/151 places, 98/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/151 places, 98/282 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22349 reset in 112 ms.
Product exploration explored 100000 steps with 22542 reset in 119 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46256 steps, run visited all 1 properties in 96 ms. (steps per millisecond=481 )
Probabilistic random walk after 46256 steps, saw 19471 distinct states, run finished after 96 ms. (steps per millisecond=481 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(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 11 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 12:39:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:45] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:39:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 12:39:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-11 12:39:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 12:39:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:45] [INFO ] Dead Transitions using invariants and state equation in 50 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46256 steps, run visited all 1 properties in 54 ms. (steps per millisecond=856 )
Probabilistic random walk after 46256 steps, saw 19471 distinct states, run finished after 54 ms. (steps per millisecond=856 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22529 reset in 108 ms.
Product exploration explored 100000 steps with 22532 reset in 115 ms.
Built C files in :
/tmp/ltsmin5373476910969049224
[2022-06-11 12:39:46] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-11 12:39:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:46] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-11 12:39:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:46] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-11 12:39:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5373476910969049224
Running compilation step : cd /tmp/ltsmin5373476910969049224;'/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 300 ms.
Running link step : cd /tmp/ltsmin5373476910969049224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5373476910969049224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4803637499518498605.hoa' '--buchi-type=spotba'
LTSmin run took 410 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 finished in 2791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U !X(p1)))&&G((G(X(!p2)) U p3)))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 134 transition count 183
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 119 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 119 transition count 168
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 75 place count 119 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 109 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 109 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 109 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 105 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 105 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 102 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 102 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 100 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 100 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 99 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 99 transition count 128
Applied a total of 123 rules in 16 ms. Remains 99 /151 variables (removed 52) and now considering 128/282 (removed 154) transitions.
// Phase 1: matrix 128 rows 99 cols
[2022-06-11 12:39:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:47] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 128 rows 99 cols
[2022-06-11 12:39:47] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:39:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-11 12:39:47] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 99 cols
[2022-06-11 12:39:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/151 places, 128/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/151 places, 128/282 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p3) p1), p1, (OR (NOT p3) (AND p1 p2)), p1, (AND p1 p2), (OR (AND p2 (NOT p3)) (AND p1 p2)), (AND p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=p2, acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p3) p1 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=p2, acceptance={1} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s55 1)), p3:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (GEQ s1 1) (GEQ s93 1)), p2:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 finished in 713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F((G(X(G((X(p1)&&p2))))||p0))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 133 transition count 162
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 116 transition count 145
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 116 transition count 145
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 116 transition count 134
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 105 transition count 122
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 105 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 105 transition count 116
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 99 transition count 109
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 99 transition count 109
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 127 place count 94 transition count 104
Iterating global reduction 3 with 5 rules applied. Total rules applied 132 place count 94 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 91 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 91 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 140 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 89 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 89 transition count 97
Applied a total of 144 rules in 19 ms. Remains 89 /151 variables (removed 62) and now considering 97/282 (removed 185) transitions.
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:48] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-11 12:39:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/151 places, 97/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/151 places, 97/282 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s77 1)), p0:(OR (LT s1 1) (LT s77 1)), p1:(OR (LT s1 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22456 reset in 185 ms.
Product exploration explored 100000 steps with 22485 reset in 152 ms.
Computed a total of 22 stabilizing places and 26 stable transitions
Computed a total of 22 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Probably explored full state space saw : 58457 states, properties seen :1
Probabilistic random walk after 146783 steps, saw 58457 distinct states, run finished after 195 ms. (steps per millisecond=752 ) properties seen :1
Explored full state space saw : 58457 states, properties seen :0
Exhaustive walk after 146783 steps, saw 58457 distinct states, run finished after 140 ms. (steps per millisecond=1048 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 97/97 transitions.
Applied a total of 0 rules in 12 ms. Remains 89 /89 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:50] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:50] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-06-11 12:39:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:39:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:50] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 97/97 transitions.
Computed a total of 22 stabilizing places and 26 stable transitions
Computed a total of 22 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 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 497 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3787 steps, run visited all 1 properties in 7 ms. (steps per millisecond=541 )
Probabilistic random walk after 3787 steps, saw 1712 distinct states, run finished after 7 ms. (steps per millisecond=541 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22328 reset in 108 ms.
Product exploration explored 100000 steps with 22331 reset in 111 ms.
Built C files in :
/tmp/ltsmin134480142150979839
[2022-06-11 12:39:51] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2022-06-11 12:39:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:51] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2022-06-11 12:39:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:51] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2022-06-11 12:39:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:39:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin134480142150979839
Running compilation step : cd /tmp/ltsmin134480142150979839;'/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 224 ms.
Running link step : cd /tmp/ltsmin134480142150979839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin134480142150979839;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16353393002047960619.hoa' '--buchi-type=spotba'
LTSmin run took 858 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 finished in 4253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1) U ((p1 U !p2)&&G(p3))))||p0)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 181
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 117 transition count 165
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 117 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 117 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 106 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 106 transition count 143
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 106 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 101 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 95 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 135 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 92 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 90 transition count 113
Applied a total of 145 rules in 12 ms. Remains 90 /151 variables (removed 61) and now considering 113/282 (removed 169) transitions.
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 12:39:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:52] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 12:39:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-11 12:39:52] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 12:39:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:52] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 113/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/151 places, 113/282 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), true, (NOT p1), (NOT p3), (OR (NOT p3) p2), (OR (NOT p3) p2), (NOT p3), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p2 p1 p3), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p3), acceptance={} source=5 dest: 7}, { cond=(AND p2 p1 p3), acceptance={} source=5 dest: 8}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p3) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1 p3), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 p3), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s32 1)), p2:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s84 1)), p3:(AND (GEQ s1 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 14 stabilizing places and 15 stable transitions
Computed a total of 14 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p2 p1 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (OR (AND (NOT p2) p3) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p3)))))
Knowledge based reduction with 17 factoid took 365 ms. Reduced automaton from 9 states, 31 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 finished in 1465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((X(G(p0))||p1) U !p2) U p0))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 194
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 134 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 119 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 119 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 119 transition count 169
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 109 transition count 157
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 109 transition count 157
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 105 place count 109 transition count 146
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 104 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 104 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 100 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 100 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 98 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 94 transition count 129
Applied a total of 135 rules in 14 ms. Remains 94 /151 variables (removed 57) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:39:53] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:53] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:39:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 12:39:53] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 12:39:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:53] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 129/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/151 places, 129/282 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), p2, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 finished in 556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(!G(p1))&&p0) U X(p2)))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 162
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 132 transition count 160
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 115 transition count 143
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 115 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 115 transition count 132
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 104 transition count 119
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 104 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 104 transition count 114
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 119 place count 97 transition count 106
Iterating global reduction 3 with 7 rules applied. Total rules applied 126 place count 97 transition count 106
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 132 place count 91 transition count 100
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 91 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 87 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 87 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 87 transition count 94
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 84 transition count 91
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 83 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 82 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 81 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 81 transition count 87
Applied a total of 160 rules in 17 ms. Remains 81 /151 variables (removed 70) and now considering 87/282 (removed 195) transitions.
// Phase 1: matrix 87 rows 81 cols
[2022-06-11 12:39:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:54] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 87 rows 81 cols
[2022-06-11 12:39:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:39:54] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 81 cols
[2022-06-11 12:39:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/151 places, 87/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/151 places, 87/282 transitions.
Stuttering acceptance computed with spot in 222 ms :[p2, p2, (AND (NOT p1) p2), true, (AND p2 (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s70 1)), p2:(AND (GEQ s1 1) (GEQ s66 1)), p1:(AND (GEQ s1 1) (GEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 157 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 finished in 915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(X(p1))))&&X((F(p2)&&p3))&&p0)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 194
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 134 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 119 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 119 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 119 transition count 169
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 109 transition count 157
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 109 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 104 place count 109 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 105 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 105 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 102 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 102 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 100 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 100 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 99 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 96 transition count 132
Applied a total of 130 rules in 16 ms. Remains 96 /151 variables (removed 55) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2022-06-11 12:39:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:55] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 132 rows 96 cols
[2022-06-11 12:39:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:55] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-11 12:39:55] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 96 cols
[2022-06-11 12:39:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:55] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/151 places, 132/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/151 places, 132/282 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p2) (NOT p1)), true, (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p3, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s91 1)), p3:(OR (LT s1 1) (LT s88 1)), p2:(OR (LT s1 1) (LT s90 1)), p1:(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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 finished in 689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U X(p1))&&F(G(X(p2)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 134 transition count 173
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 118 transition count 157
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 118 transition count 157
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 77 place count 118 transition count 147
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 89 place count 106 transition count 133
Iterating global reduction 2 with 12 rules applied. Total rules applied 101 place count 106 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 106 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 102 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 102 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 99 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 99 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 97 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 95 transition count 112
Applied a total of 133 rules in 12 ms. Remains 95 /151 variables (removed 56) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 95 cols
[2022-06-11 12:39:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:39:55] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 112 rows 95 cols
[2022-06-11 12:39:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:39:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-11 12:39:56] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 95 cols
[2022-06-11 12:39:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:39:56] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/151 places, 112/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/151 places, 112/282 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s67 1)), p0:(AND (GEQ s1 1) (GEQ s39 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 finished in 488 ms.
All properties solved by simple procedures.
Total runtime 30497 ms.

BK_STOP 1654951196380

--------------------
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-d1m06"
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-d1m06, 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-165472282900900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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