Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679313621023

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:00:22] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-20 12:00:22] [INFO ] Transformed 262 places.
[2023-03-20 12:00:22] [INFO ] Transformed 73 transitions.
[2023-03-20 12:00:22] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 67 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 67 transition count 70
Applied a total of 8 rules in 17 ms. Remains 67 /72 variables (removed 5) and now considering 70/73 (removed 3) transitions.
// Phase 1: matrix 70 rows 67 cols
[2023-03-20 12:00:23] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-20 12:00:23] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-20 12:00:23] [INFO ] Invariant cache hit.
[2023-03-20 12:00:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 12:00:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-20 12:00:23] [INFO ] Invariant cache hit.
[2023-03-20 12:00:23] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 70/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 67/72 places, 70/73 transitions.
Support contains 28 out of 67 places after structural reductions.
[2023-03-20 12:00:23] [INFO ] Flatten gal took : 22 ms
[2023-03-20 12:00:23] [INFO ] Flatten gal took : 19 ms
[2023-03-20 12:00:23] [INFO ] Input system was already deterministic with 70 transitions.
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 158 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 152 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-20 12:00:24] [INFO ] Invariant cache hit.
[2023-03-20 12:00:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:00:24] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-20 12:00:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-20 12:00:24] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :14
[2023-03-20 12:00:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 12:00:25] [INFO ] After 119ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :6 sat :14
[2023-03-20 12:00:25] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :14
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-20 12:00:25] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :14
Fused 20 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 68
Applied a total of 4 rules in 21 ms. Remains 65 /67 variables (removed 2) and now considering 68/70 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 65/67 places, 68/70 transitions.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1533 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1523 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1091 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 68 rows 65 cols
[2023-03-20 12:00:26] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:00:26] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:00:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 12:00:26] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:00:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:00:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:26] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:00:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 12:00:26] [INFO ] After 142ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-20 12:00:26] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-20 12:00:26] [INFO ] After 519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 14 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 65/65 places, 68/68 transitions.
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1537 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1536 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Probably explored full state space saw : 702 states, properties seen :6
Probabilistic random walk after 1686 steps, saw 702 distinct states, run finished after 19 ms. (steps per millisecond=88 ) properties seen :6
Explored full state space saw : 702 states, properties seen :0
Exhaustive walk after 1686 steps, saw 702 distinct states, run finished after 17 ms. (steps per millisecond=99 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 205 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))&&F((G(p2)||G(p0))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 6 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:00:28] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:00:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:00:28] [INFO ] Invariant cache hit.
[2023-03-20 12:00:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-20 12:00:28] [INFO ] Invariant cache hit.
[2023-03-20 12:00:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(AND (GEQ s1 1) (GEQ s42 1)), p2:(OR (LT s1 1) (LT s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&F(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Applied a total of 14 rules in 5 ms. Remains 60 /67 variables (removed 7) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-20 12:00:28] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:00:28] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 12:00:28] [INFO ] Invariant cache hit.
[2023-03-20 12:00:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:00:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-20 12:00:28] [INFO ] Invariant cache hit.
[2023-03-20 12:00:29] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 63/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 60/67 places, 63/70 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s28 1)), p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28566 reset in 262 ms.
Product exploration explored 100000 steps with 28535 reset in 231 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 12:00:30] [INFO ] Invariant cache hit.
[2023-03-20 12:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:00:30] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 12:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:30] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 12:00:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:00:30] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 12:00:30] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 12:00:30] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 63/63 transitions.
Graph (complete) has 166 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 61
Applied a total of 3 rules in 7 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/60 places, 61/63 transitions.
Incomplete random walk after 10000 steps, including 2205 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 7222 steps, including 331 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1805 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-20 12:00:30] [INFO ] Invariant cache hit.
[2023-03-20 12:00:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 12:00:30] [INFO ] Invariant cache hit.
[2023-03-20 12:00:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:00:31] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 12:00:31] [INFO ] Invariant cache hit.
[2023-03-20 12:00:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 60/60 places, 63/63 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 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 10 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 7967 steps, including 380 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1327 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28551 reset in 87 ms.
Product exploration explored 100000 steps with 28592 reset in 141 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 105 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, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 3 place count 59 transition count 61
Applied a total of 3 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
[2023-03-20 12:00:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:00:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:00:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 59/60 places, 61/63 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 3 place count 59 transition count 61
Applied a total of 3 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/60 places, 61/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 59/60 places, 61/63 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 finished in 3705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))&&p0))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 66
Applied a total of 8 rules in 3 ms. Remains 63 /67 variables (removed 4) and now considering 66/70 (removed 4) transitions.
// Phase 1: matrix 66 rows 63 cols
[2023-03-20 12:00:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 66/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 63/67 places, 66/70 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s28 1)), p1:(OR (LT s1 1) (LT s19 1) (LT s1 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0 U X(!p0)))||(G(p2)&&p1))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 4 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:00:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:32] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-20 12:00:32] [INFO ] Invariant cache hit.
[2023-03-20 12:00:33] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0), p0, true, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 9}], [{ cond=p0, acceptance={} source=9 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(AND (GEQ s1 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28552 reset in 120 ms.
Product exploration explored 100000 steps with 28562 reset in 126 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 384 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 17 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, p0, p0, true]
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 LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:00:34] [INFO ] Invariant cache hit.
[2023-03-20 12:00:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:00:34] [INFO ] Invariant cache hit.
[2023-03-20 12:00:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:34] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-20 12:00:34] [INFO ] Invariant cache hit.
[2023-03-20 12:00:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 11 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 196 ms :[p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 28580 reset in 79 ms.
Product exploration explored 100000 steps with 28581 reset in 86 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0, p0, p0, true]
Support contains 2 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 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42 ms. Remains : 59/59 places, 61/61 transitions.
Support contains 2 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 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:36] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 finished in 3453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 3 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-20 12:00:36] [INFO ] Invariant cache hit.
[2023-03-20 12:00:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s5 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0 U X(!p0)))||(G(p2)&&p1))))'
[2023-03-20 12:00:36] [INFO ] Flatten gal took : 15 ms
[2023-03-20 12:00:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 12:00:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 70 transitions and 277 arcs took 2 ms.
Total runtime 13987 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1211/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1211/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m04-LTLFireability-13

BK_STOP 1679313637153

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
ltl formula formula --ltl=/tmp/1211/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 67 places, 70 transitions and 277 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1211/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1211/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1211/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1211/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
ltl formula formula --ltl=/tmp/1211/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 67 places, 70 transitions and 277 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1211/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1211/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1211/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1211/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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