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.r423-tajo-167905976600356.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 lolaxred
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 r423-tajo-167905976600356
=====================================================================

--------------------
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 1679246593007

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:23:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:23:14] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-19 17:23:14] [INFO ] Transformed 262 places.
[2023-03-19 17:23:14] [INFO ] Transformed 73 transitions.
[2023-03-19 17:23:14] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 20 ms. Remains 67 /72 variables (removed 5) and now considering 70/73 (removed 3) transitions.
// Phase 1: matrix 70 rows 67 cols
[2023-03-19 17:23:14] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-19 17:23:15] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-19 17:23:15] [INFO ] Invariant cache hit.
[2023-03-19 17:23:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 17:23:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-19 17:23:15] [INFO ] Invariant cache hit.
[2023-03-19 17:23:15] [INFO ] Dead Transitions using invariants and state equation in 63 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 455 ms. Remains : 67/72 places, 70/73 transitions.
Support contains 28 out of 67 places after structural reductions.
[2023-03-19 17:23:15] [INFO ] Flatten gal took : 30 ms
[2023-03-19 17:23:15] [INFO ] Flatten gal took : 19 ms
[2023-03-19 17:23:15] [INFO ] Input system was already deterministic with 70 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 153 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 150 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 114 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 126 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-19 17:23:16] [INFO ] Invariant cache hit.
[2023-03-19 17:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:23:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:23:16] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-19 17:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:23:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:23:16] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :14
[2023-03-19 17:23:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 17:23:16] [INFO ] After 136ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :6 sat :14
[2023-03-19 17:23:17] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :14
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-19 17:23:17] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :14
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 76 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 17 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 17 ms. Remains : 65/67 places, 68/70 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1536 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1538 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Probably explored full state space saw : 702 states, properties seen :7
Probabilistic random walk after 1686 steps, saw 702 distinct states, run finished after 30 ms. (steps per millisecond=56 ) properties seen :7
Explored full state space saw : 702 states, properties seen :0
Exhaustive walk after 1686 steps, saw 702 distinct states, run finished after 18 ms. (steps per millisecond=93 ) 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 7 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:23:19] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:23:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 17:23:19] [INFO ] Invariant cache hit.
[2023-03-19 17:23:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-19 17:23:19] [INFO ] Invariant cache hit.
[2023-03-19 17:23:19] [INFO ] Dead Transitions using invariants and state equation in 43 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 188 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 321 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 23 steps with 5 reset in 4 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 finished in 582 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 6 ms. Remains 60 /67 variables (removed 7) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-19 17:23:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:23:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 17:23:20] [INFO ] Invariant cache hit.
[2023-03-19 17:23:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:23:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-19 17:23:20] [INFO ] Invariant cache hit.
[2023-03-19 17:23:20] [INFO ] Dead Transitions using invariants and state equation in 57 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 205 ms. Remains : 60/67 places, 63/70 transitions.
Stuttering acceptance computed with spot in 228 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 28613 reset in 179 ms.
Product exploration explored 100000 steps with 28563 reset in 159 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.1 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 167 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 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:23:21] [INFO ] Invariant cache hit.
[2023-03-19 17:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:23:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:23:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 17:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:23:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:23:21] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 17:23:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:23:21] [INFO ] After 7ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 17:23:21] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 17:23:21] [INFO ] After 66ms 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 12 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 12 ms. Remains : 59/60 places, 61/63 transitions.
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 258 steps, run visited all 1 properties in 6 ms. (steps per millisecond=43 )
Probabilistic random walk after 258 steps, saw 138 distinct states, run finished after 6 ms. (steps per millisecond=43 ) properties seen :1
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 225 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 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 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 2 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-19 17:23:22] [INFO ] Invariant cache hit.
[2023-03-19 17:23:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 17:23:22] [INFO ] Invariant cache hit.
[2023-03-19 17:23:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:23:22] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 17:23:22] [INFO ] Invariant cache hit.
[2023-03-19 17:23:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 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 57 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 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 1163 steps, including 46 resets, run visited all 1 properties in 2 ms. (steps per millisecond=581 )
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 (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)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28589 reset in 99 ms.
Product exploration explored 100000 steps with 28559 reset in 212 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 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 7 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
[2023-03-19 17:23:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:23:23] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 17:23:23] [INFO ] Dead Transitions using invariants and state equation in 54 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 68 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 4 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
[2023-03-19 17:23:23] [INFO ] Invariant cache hit.
[2023-03-19 17:23:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:23:23] [INFO ] Invariant cache hit.
[2023-03-19 17:23:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:23] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-19 17:23:23] [INFO ] Invariant cache hit.
[2023-03-19 17:23:23] [INFO ] Dead Transitions using invariants and state equation in 44 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 267 ms. Remains : 59/60 places, 61/63 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 finished in 3922 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-19 17:23:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:23:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 17:23:24] [INFO ] Invariant cache hit.
[2023-03-19 17:23:24] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-19 17:23:24] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-19 17:23:24] [INFO ] Invariant cache hit.
[2023-03-19 17:23:24] [INFO ] Dead Transitions using invariants and state equation in 45 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 224 ms. Remains : 63/67 places, 66/70 transitions.
Stuttering acceptance computed with spot in 196 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 451 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 5 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:23:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:23:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-19 17:23:24] [INFO ] Invariant cache hit.
[2023-03-19 17:23:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-19 17:23:24] [INFO ] Invariant cache hit.
[2023-03-19 17:23:24] [INFO ] Dead Transitions using invariants and state equation in 43 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 246 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 399 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 28574 reset in 158 ms.
Product exploration explored 100000 steps with 28565 reset in 172 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.5 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 313 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 182 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 343 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 209 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 225 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-19 17:23:26] [INFO ] Invariant cache hit.
[2023-03-19 17:23:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 17:23:26] [INFO ] Invariant cache hit.
[2023-03-19 17:23:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:26] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 17:23:26] [INFO ] Invariant cache hit.
[2023-03-19 17:23:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 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 101 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 228 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 137 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 255 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 178 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 28594 reset in 99 ms.
Product exploration explored 100000 steps with 28574 reset in 121 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 291 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-19 17:23:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:23:28] [INFO ] Invariant cache hit.
[2023-03-19 17:23:28] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 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-19 17:23:28] [INFO ] Invariant cache hit.
[2023-03-19 17:23:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 17:23:28] [INFO ] Invariant cache hit.
[2023-03-19 17:23:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 17:23:29] [INFO ] Invariant cache hit.
[2023-03-19 17:23:29] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 finished in 4753 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-19 17:23:29] [INFO ] Invariant cache hit.
[2023-03-19 17:23:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 17:23:29] [INFO ] Invariant cache hit.
[2023-03-19 17:23:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:23:29] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-19 17:23:29] [INFO ] Invariant cache hit.
[2023-03-19 17:23:29] [INFO ] Dead Transitions using invariants and state equation in 132 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 343 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 197 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 3 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 554 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-19 17:23:29] [INFO ] Flatten gal took : 12 ms
[2023-03-19 17:23:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 17:23:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 70 transitions and 277 arcs took 1 ms.
Total runtime 15332 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d0m04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679246610264

--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
lola: result : true
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
lola: result : true
lola: markings : 14
lola: fired transitions : 18
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d0m04-LTLFireability-06: LTL true LTL model checker
SieveSingleMsgMbox-PT-d0m04-LTLFireability-13: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
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 lolaxred"
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 r423-tajo-167905976600356"
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 ;