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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:03 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-d0m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654949477786

Running Version 202205111006
[2022-06-11 12:11:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 12:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:11:19] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-11 12:11:19] [INFO ] Transformed 262 places.
[2022-06-11 12:11:19] [INFO ] Transformed 73 transitions.
[2022-06-11 12:11:19] [INFO ] Parsed PT model containing 262 places and 73 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 73
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 63 transition count 65
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 63 transition count 65
Applied a total of 17 rules in 17 ms. Remains 63 /72 variables (removed 9) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 63 cols
[2022-06-11 12:11:19] [INFO ] Computed 5 place invariants in 14 ms
[2022-06-11 12:11:19] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 65 rows 63 cols
[2022-06-11 12:11:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:11:19] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 63 cols
[2022-06-11 12:11:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:19] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 65/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/72 places, 65/73 transitions.
Support contains 14 out of 63 places after structural reductions.
[2022-06-11 12:11:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-11 12:11:19] [INFO ] Flatten gal took : 26 ms
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-11 12:11:19] [INFO ] Flatten gal took : 11 ms
[2022-06-11 12:11:19] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1015 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 65 rows 63 cols
[2022-06-11 12:11:20] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 12:11:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:11:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:11:20] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-11 12:11:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:11:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:11:20] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-11 12:11:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:11:20] [INFO ] After 12ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-11 12:11:20] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-11 12:11:20] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 65/65 transitions.
Graph (complete) has 174 edges and 63 vertex of which 61 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 61 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 59 transition count 61
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 58 transition count 59
Applied a total of 10 rules in 18 ms. Remains 58 /63 variables (removed 5) and now considering 59/65 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/63 places, 59/65 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 391 steps, run visited all 2 properties in 15 ms. (steps per millisecond=26 )
Probabilistic random walk after 391 steps, saw 230 distinct states, run finished after 15 ms. (steps per millisecond=26 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 195 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((X(G(F(p1)))||F(p1)))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 65/65 transitions.
Graph (complete) has 195 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 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 6 place count 60 transition count 62
Applied a total of 6 rules in 12 ms. Remains 60 /63 variables (removed 3) and now considering 62/65 (removed 3) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:21] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:21] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-06-11 12:11:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:21] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 62/65 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/63 places, 62/65 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s35 s11), p1:(GT s33 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 138 steps with 29 reset in 12 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 65/65 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 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 7 place count 60 transition count 61
Applied a total of 7 rules in 6 ms. Remains 60 /63 variables (removed 3) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:21] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:22] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 61/65 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/63 places, 61/65 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s41 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28569 reset in 210 ms.
Product exploration explored 100000 steps with 28584 reset in 123 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 136 steps, run visited all 1 properties in 4 ms. (steps per millisecond=34 )
Probabilistic random walk after 136 steps, saw 79 distinct states, run finished after 4 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:23] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:11:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:11:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 662 steps, including 147 resets, run visited all 1 properties in 1 ms. (steps per millisecond=662 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28604 reset in 85 ms.
Product exploration explored 100000 steps with 28596 reset in 169 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 11 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2022-06-11 12:11:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-06-11 12:11:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:24] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Product exploration explored 100000 steps with 28550 reset in 154 ms.
Product exploration explored 100000 steps with 28542 reset in 157 ms.
Built C files in :
/tmp/ltsmin11613545052403397268
[2022-06-11 12:11:25] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11613545052403397268
Running compilation step : cd /tmp/ltsmin11613545052403397268;'/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 222 ms.
Running link step : cd /tmp/ltsmin11613545052403397268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11613545052403397268;'/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/stateBased6945965318251856098.hoa' '--buchi-type=spotba'
LTSmin run took 173 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 finished in 3795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0) U p1)&&p0))||G((G(p2)||p2))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 65/65 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 59 transition count 61
Applied a total of 8 rules in 8 ms. Remains 59 /63 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:25] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:25] [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 12:11:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/65 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/65 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ s45 0), p0:(LEQ s11 0), p1:(LEQ s31 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 123 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 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 15 factoid took 396 ms. Reduced automaton from 9 states, 20 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 finished in 1154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1)||p2)))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 65/65 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 59 transition count 61
Applied a total of 8 rules in 10 ms. Remains 59 /63 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:26] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:26] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/65 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/65 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s55 0), p0:(LEQ s14 s20), p1:(LEQ 1 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22315 reset in 169 ms.
Product exploration explored 100000 steps with 22348 reset in 201 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Finished probabilistic random walk after 391 steps, run visited all 3 properties in 9 ms. (steps per millisecond=43 )
Probabilistic random walk after 391 steps, saw 230 distinct states, run finished after 11 ms. (steps per millisecond=35 ) properties seen :3
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 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 3 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 12:11:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:28] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:11:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:28] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:28] [INFO ] Dead Transitions using invariants and state equation in 41 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 p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2202 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Finished probabilistic random walk after 391 steps, run visited all 3 properties in 6 ms. (steps per millisecond=65 )
Probabilistic random walk after 391 steps, saw 230 distinct states, run finished after 6 ms. (steps per millisecond=65 ) properties seen :3
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 22446 reset in 82 ms.
Product exploration explored 100000 steps with 22383 reset in 89 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 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 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2022-06-11 12:11:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Product exploration explored 100000 steps with 22436 reset in 76 ms.
Product exploration explored 100000 steps with 22330 reset in 88 ms.
Built C files in :
/tmp/ltsmin2631471339204234053
[2022-06-11 12:11:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2631471339204234053
Running compilation step : cd /tmp/ltsmin2631471339204234053;'/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 139 ms.
Running link step : cd /tmp/ltsmin2631471339204234053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2631471339204234053;'/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/stateBased16007864119423562775.hoa' '--buchi-type=spotba'
LTSmin run took 364 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 finished in 4275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 65/65 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 59 transition count 61
Applied a total of 8 rules in 4 ms. Remains 59 /63 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:11:31] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:11:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:11:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:11:31] [INFO ] Implicit Places using invariants and state equation in 70 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 12:11:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/65 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/65 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 109 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 finished in 585 ms.
All properties solved by simple procedures.
Total runtime 12737 ms.

BK_STOP 1654949491741

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-d0m96"
export BK_EXAMINATION="LTLCardinality"
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-d0m96, examination is LTLCardinality"
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-165472282900883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m96.tgz
mv SieveSingleMsgMbox-PT-d0m96 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;