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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Jun 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 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 57K 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-d0m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654944713735

Running Version 202205111006
[2022-06-11 10:51:54] [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 10:51:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 10:51:55] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-06-11 10:51:55] [INFO ] Transformed 262 places.
[2022-06-11 10:51:55] [INFO ] Transformed 73 transitions.
[2022-06-11 10:51:55] [INFO ] Parsed PT model containing 262 places and 73 transitions in 174 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 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 66 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 66 transition count 69
Applied a total of 10 rules in 15 ms. Remains 66 /72 variables (removed 6) and now considering 69/73 (removed 4) transitions.
// Phase 1: matrix 69 rows 66 cols
[2022-06-11 10:51:55] [INFO ] Computed 5 place invariants in 10 ms
[2022-06-11 10:51:55] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 69 rows 66 cols
[2022-06-11 10:51:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:51:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-11 10:51:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 66 cols
[2022-06-11 10:51:55] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 10:51:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 69/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/72 places, 69/73 transitions.
Support contains 30 out of 66 places after structural reductions.
[2022-06-11 10:51:55] [INFO ] Flatten gal took : 34 ms
[2022-06-11 10:51:55] [INFO ] Flatten gal took : 10 ms
[2022-06-11 10:51:55] [INFO ] Input system was already deterministic with 69 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 69 rows 66 cols
[2022-06-11 10:51:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:51:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:51:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:51:56] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:18
[2022-06-11 10:51:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:51:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:51:57] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :18
[2022-06-11 10:51:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-11 10:51:57] [INFO ] After 138ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :3 sat :18
[2022-06-11 10:51:57] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :18
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-06-11 10:51:57] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :18
Fused 21 Parikh solutions to 16 different solutions.
Parikh walk visited 2 properties in 129 ms.
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 69/69 transitions.
Graph (complete) has 178 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 65 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 63 transition count 65
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 63 transition count 65
Applied a total of 7 rules in 27 ms. Remains 63 /66 variables (removed 3) and now considering 65/69 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/66 places, 65/69 transitions.
Incomplete random walk after 10000 steps, including 2186 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 114 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Finished probabilistic random walk after 3656 steps, run visited all 16 properties in 52 ms. (steps per millisecond=70 )
Probabilistic random walk after 3656 steps, saw 1909 distinct states, run finished after 52 ms. (steps per millisecond=70 ) properties seen :16
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 9 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(F((p0 U !p0)))))||p1)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 60 transition count 62
Applied a total of 13 rules in 11 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:51:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:51:58] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:51:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:51:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:51:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-11 10:51:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:51:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:51:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s18 1) (OR (LT s1 1) (LT s37 1))), p0:(AND (GEQ s1 1) (GEQ s53 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 28535 reset in 247 ms.
Product exploration explored 100000 steps with 28589 reset in 132 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:51:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:51:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:51:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:51:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 10:51:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:51:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:51:59] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 10:51:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:51:59] [INFO ] After 10ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 10:51:59] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-11 10:51:59] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 163 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/60 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 383 steps, run visited all 1 properties in 4 ms. (steps per millisecond=95 )
Probabilistic random walk after 383 steps, saw 223 distinct states, run finished after 4 ms. (steps per millisecond=95 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:52:00] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:52:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-11 10:52:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:52:00] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 10:52:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:52:00] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:52:00] [INFO ] After 29ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:00] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-11 10:52:00] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 163 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/60 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2202 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 383 steps, run visited all 1 properties in 5 ms. (steps per millisecond=76 )
Probabilistic random walk after 383 steps, saw 223 distinct states, run finished after 5 ms. (steps per millisecond=76 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 28567 reset in 103 ms.
Product exploration explored 100000 steps with 28549 reset in 95 ms.
Built C files in :
/tmp/ltsmin13062128909594492539
[2022-06-11 10:52:01] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 10:52:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:01] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 10:52:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:01] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 10:52:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13062128909594492539
Running compilation step : cd /tmp/ltsmin13062128909594492539;'/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 237 ms.
Running link step : cd /tmp/ltsmin13062128909594492539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13062128909594492539;'/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/stateBased15705778738424461146.hoa' '--buchi-type=spotba'
LTSmin run took 69 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 finished in 3431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))&&X(G(p2))&&p2)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 13 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:02] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:02] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-06-11 10:52:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:52:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s53 1)), p0:(OR (LT s1 1) (LT s53 1)), p1:(OR (LT s1 1) (LT s19 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 22489 reset in 99 ms.
Product exploration explored 100000 steps with 22301 reset in 94 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 755 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 797 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:03] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:52:03] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-11 10:52:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2022-06-11 10:52:03] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-11 10:52:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:03] [INFO ] After 7ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-11 10:52:03] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-11 10:52:03] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/59 places, 59/61 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 369 steps, run visited all 1 properties in 6 ms. (steps per millisecond=61 )
Probabilistic random walk after 369 steps, saw 212 distinct states, run finished after 6 ms. (steps per millisecond=61 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 401 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Support contains 2 out of 59 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 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:04] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:04] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-06-11 10:52:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
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 26 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 369 steps, run visited all 1 properties in 3 ms. (steps per millisecond=123 )
Probabilistic random walk after 369 steps, saw 212 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 138 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 25 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Product exploration explored 100000 steps with 22362 reset in 181 ms.
Product exploration explored 100000 steps with 22360 reset in 123 ms.
Built C files in :
/tmp/ltsmin3448625136676826600
[2022-06-11 10:52:04] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:52:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:04] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:52:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:04] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:52:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3448625136676826600
Running compilation step : cd /tmp/ltsmin3448625136676826600;'/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 148 ms.
Running link step : cd /tmp/ltsmin3448625136676826600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3448625136676826600;'/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/stateBased10966280219204321443.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 3316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((G(F(p1))||G(!X(p0))))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 12 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:05] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-06-11 10:52:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22446 reset in 94 ms.
Product exploration explored 100000 steps with 22456 reset in 102 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 321 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Finished probabilistic random walk after 370 steps, run visited all 3 properties in 7 ms. (steps per millisecond=52 )
Probabilistic random walk after 370 steps, saw 213 distinct states, run finished after 7 ms. (steps per millisecond=52 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 420 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:07] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Finished probabilistic random walk after 370 steps, run visited all 3 properties in 8 ms. (steps per millisecond=46 )
Probabilistic random walk after 370 steps, saw 213 distinct states, run finished after 8 ms. (steps per millisecond=46 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22420 reset in 116 ms.
Product exploration explored 100000 steps with 22334 reset in 93 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2022-06-11 10:52:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Product exploration explored 100000 steps with 22428 reset in 183 ms.
Product exploration explored 100000 steps with 22193 reset in 184 ms.
Built C files in :
/tmp/ltsmin14836632983307076813
[2022-06-11 10:52:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14836632983307076813
Running compilation step : cd /tmp/ltsmin14836632983307076813;'/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 137 ms.
Running link step : cd /tmp/ltsmin14836632983307076813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14836632983307076813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6823762215786852555.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 5170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((false U p1))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 60 transition count 62
Applied a total of 13 rules in 5 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 10:52:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:10] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s49 1)), p1:(AND (GEQ s14 1) (GEQ s19 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X((!p0 U (!p1||G(!p0))))&&!p0))))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Applied a total of 10 rules in 3 ms. Remains 61 /66 variables (removed 5) and now considering 64/69 (removed 5) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:10] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:52:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:52:10] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/66 places, 64/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/66 places, 64/69 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s9 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22362 reset in 174 ms.
Product exploration explored 100000 steps with 22400 reset in 117 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 152 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 4 ms. (steps per millisecond=71 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 4 ms. (steps per millisecond=71 ) properties seen :1
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:12] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:52:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:52:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 7 ms. (steps per millisecond=40 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 7 ms. (steps per millisecond=40 ) properties seen :1
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 401 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 22270 reset in 81 ms.
Product exploration explored 100000 steps with 22404 reset in 86 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 59 transition count 61
Applied a total of 5 rules in 11 ms. Remains 59 /61 variables (removed 2) and now considering 61/64 (removed 3) transitions.
[2022-06-11 10:52:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 61/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 61/64 transitions.
Product exploration explored 100000 steps with 22456 reset in 140 ms.
Product exploration explored 100000 steps with 22386 reset in 118 ms.
Built C files in :
/tmp/ltsmin13318542769051825589
[2022-06-11 10:52:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13318542769051825589
Running compilation step : cd /tmp/ltsmin13318542769051825589;'/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 134 ms.
Running link step : cd /tmp/ltsmin13318542769051825589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin13318542769051825589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6086675706775122002.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 finished in 3436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 61 transition count 63
Applied a total of 11 rules in 7 ms. Remains 61 /66 variables (removed 5) and now considering 63/69 (removed 6) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:14] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 10:52:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-11 10:52:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/66 places, 63/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/66 places, 63/69 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s24 1)), p1:(OR (LT s1 1) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23091 reset in 97 ms.
Product exploration explored 100000 steps with 23045 reset in 99 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:52:15] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 10:52:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 10:52:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:52:15] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 10:52:15] [INFO ] After 18ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:15] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-11 10:52:15] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 164 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Applied a total of 3 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 61/63 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/61 places, 61/63 transitions.
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1301 steps, run visited all 1 properties in 4 ms. (steps per millisecond=325 )
Probabilistic random walk after 1301 steps, saw 656 distinct states, run finished after 4 ms. (steps per millisecond=325 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 10:52:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-11 10:52:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 63/63 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:52:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-11 10:52:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:52:15] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 10:52:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:52:16] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 10:52:16] [INFO ] After 12ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:16] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-11 10:52:16] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 164 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Applied a total of 3 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 61/63 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/61 places, 61/63 transitions.
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1301 steps, run visited all 1 properties in 4 ms. (steps per millisecond=325 )
Probabilistic random walk after 1301 steps, saw 656 distinct states, run finished after 5 ms. (steps per millisecond=260 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23184 reset in 106 ms.
Product exploration explored 100000 steps with 23152 reset in 117 ms.
Built C files in :
/tmp/ltsmin13871279465347615364
[2022-06-11 10:52:16] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2022-06-11 10:52:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:16] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2022-06-11 10:52:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:16] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2022-06-11 10:52:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13871279465347615364
Running compilation step : cd /tmp/ltsmin13871279465347615364;'/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 144 ms.
Running link step : cd /tmp/ltsmin13871279465347615364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13871279465347615364;'/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/stateBased5719622268859353403.hoa' '--buchi-type=spotba'
LTSmin run took 50 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 finished in 2791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 5 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:17] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-11 10:52:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(!(X(G(p0)) U p0)))||(p1 U p2))))'
Support contains 3 out of 66 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 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 7 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:17] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-06-11 10:52:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND p0 (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22326 reset in 90 ms.
Product exploration explored 100000 steps with 22304 reset in 106 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:52:18] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 10:52:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:52:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:52:18] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:18] [INFO ] After 15ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 10:52:18] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-11 10:52:18] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 6 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/59 places, 59/61 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 363 steps, run visited all 1 properties in 4 ms. (steps per millisecond=90 )
Probabilistic random walk after 363 steps, saw 207 distinct states, run finished after 4 ms. (steps per millisecond=90 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p2))]
Support contains 3 out of 59 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 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 10:52:18] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-06-11 10:52:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 363 steps, run visited all 2 properties in 12 ms. (steps per millisecond=30 )
Probabilistic random walk after 363 steps, saw 207 distinct states, run finished after 13 ms. (steps per millisecond=27 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 24 ms :[(AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p2))]
Product exploration explored 100000 steps with 22503 reset in 89 ms.
Product exploration explored 100000 steps with 22424 reset in 92 ms.
Built C files in :
/tmp/ltsmin14445481719319726691
[2022-06-11 10:52:19] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:52:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:19] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:52:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:19] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:52:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:52:19] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14445481719319726691
Running compilation step : cd /tmp/ltsmin14445481719319726691;'/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 146 ms.
Running link step : cd /tmp/ltsmin14445481719319726691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin14445481719319726691;'/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/stateBased13550699150836626788.hoa' '--buchi-type=spotba'
LTSmin run took 369 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 finished in 2836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 60 transition count 62
Applied a total of 13 rules in 3 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s15 1) (GEQ s19 1)), p1:(AND (GEQ s5 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(F(G(p0)) U p1))&&(X(p2)||p3))))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 5 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), p1, (NOT p2), (AND p1 p0), (AND p1 p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s40 1)), p3:(AND (GEQ s1 1) (GEQ s44 1)), p2:(OR (AND (GEQ s1 1) (GEQ s44 1)) (AND (GEQ s1 1) (GEQ s57 1))), p0:(AND (GEQ s7 1) (G...], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 15 steps with 3 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 3 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:20] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:52:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s51 1) (LT s42 1) (AND (GEQ s8 1) (GEQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 59 transition count 61
Applied a total of 15 rules in 9 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:21] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:52:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-06-11 10:52:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:52:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s58 1)) (AND (GEQ s1 1) (GEQ s56 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 finished in 236 ms.
All properties solved by simple procedures.
Total runtime 26622 ms.

BK_STOP 1654944741637

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

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