About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
420.520 | 21871.00 | 40297.00 | 146.00 | F?FFFFFF?FFF?FFF | normal |
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-167905978100372.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-d0m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:27 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-d0m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679313751408
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-d0m18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:02:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:02:33] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-20 12:02:33] [INFO ] Transformed 262 places.
[2023-03-20 12:02:33] [INFO ] Transformed 73 transitions.
[2023-03-20 12:02:33] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 69 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 69 transition count 72
Applied a total of 4 rules in 17 ms. Remains 69 /72 variables (removed 3) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 69 cols
[2023-03-20 12:02:33] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-20 12:02:33] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-20 12:02:33] [INFO ] Invariant cache hit.
[2023-03-20 12:02:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 12:02:34] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-20 12:02:34] [INFO ] Invariant cache hit.
[2023-03-20 12:02:34] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 72/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 69/72 places, 72/73 transitions.
Support contains 34 out of 69 places after structural reductions.
[2023-03-20 12:02:34] [INFO ] Flatten gal took : 37 ms
[2023-03-20 12:02:34] [INFO ] Flatten gal took : 24 ms
[2023-03-20 12:02:34] [INFO ] Input system was already deterministic with 72 transitions.
Support contains 33 out of 69 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-20 12:02:35] [INFO ] Invariant cache hit.
[2023-03-20 12:02:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:02:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:02:35] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-20 12:02:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:02:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:02:36] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-20 12:02:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 12:02:36] [INFO ] After 96ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :1 sat :17
[2023-03-20 12:02:36] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 12:02:36] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 8 properties in 93 ms.
Support contains 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 19 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 63/69 places, 66/72 transitions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1083 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1082 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Finished probabilistic random walk after 1406 steps, run visited all 9 properties in 19 ms. (steps per millisecond=74 )
Probabilistic random walk after 1406 steps, saw 711 distinct states, run finished after 19 ms. (steps per millisecond=74 ) properties seen :9
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 211 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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' '!(F((p0||G(p1)||G(p2))))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 17 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:02:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:37] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 12:02:37] [INFO ] Invariant cache hit.
[2023-03-20 12:02:37] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 12:02:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:37] [INFO ] Invariant cache hit.
[2023-03-20 12:02:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s18 1)), p0:(AND (GEQ s1 1) (GEQ s46 1)), p2:(OR (AND (GEQ s1 1) (GEQ s41 1)) (AND (GEQ s16 1) (GEQ s35 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 finished in 441 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' '!(G(F(!p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 16 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:02:37] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 12:02:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 12:02:37] [INFO ] Invariant cache hit.
[2023-03-20 12:02:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:38] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-20 12:02:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:38] [INFO ] Invariant cache hit.
[2023-03-20 12:02:38] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22298 reset in 228 ms.
Product exploration explored 100000 steps with 22271 reset in 130 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1071 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 10 ms. (steps per millisecond=140 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 10 ms. (steps per millisecond=140 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:02:39] [INFO ] Invariant cache hit.
[2023-03-20 12:02:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 12:02:39] [INFO ] Invariant cache hit.
[2023-03-20 12:02:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:39] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 12:02:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:39] [INFO ] Invariant cache hit.
[2023-03-20 12:02:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2200 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1064 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 8 ms. (steps per millisecond=175 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 9 ms. (steps per millisecond=156 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Product exploration explored 100000 steps with 22383 reset in 78 ms.
Product exploration explored 100000 steps with 22297 reset in 191 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:02:40] [INFO ] Invariant cache hit.
[2023-03-20 12:02:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 12:02:40] [INFO ] Invariant cache hit.
[2023-03-20 12:02:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-20 12:02:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:40] [INFO ] Invariant cache hit.
[2023-03-20 12:02:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-01 finished in 2780 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' '!((G((F(p0)&&F(p1))) U p2))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 61 transition count 63
Applied a total of 17 rules in 10 ms. Remains 61 /69 variables (removed 8) and now considering 63/72 (removed 9) transitions.
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:02:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 12:02:40] [INFO ] Invariant cache hit.
[2023-03-20 12:02:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:40] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 12:02:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:40] [INFO ] Invariant cache hit.
[2023-03-20 12:02:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/69 places, 63/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 61/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s47 1)), p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s10 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-02 finished in 403 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(p0)&&(!p1 U (G(!p1)||(!p1&&G((X(p1)&&p2))))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 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 21 place count 59 transition count 61
Applied a total of 21 rules in 5 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:02:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s39 1)), p0:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-03 finished in 459 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' '!(F(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Applied a total of 18 rules in 11 ms. Remains 60 /69 variables (removed 9) and now considering 63/72 (removed 9) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-20 12:02:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-20 12:02:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 63/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 60/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-04 finished in 256 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(p0)&&G(p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 8 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:02:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-20 12:02:41] [INFO ] Invariant cache hit.
[2023-03-20 12:02:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(AND (GEQ s1 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 finished in 288 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' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 5 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-20 12:02:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-20 12:02:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/69 places, 64/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 61/69 places, 64/72 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s30 1)), p1:(AND (GEQ s10 1) (GEQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-06 finished in 296 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' '!(G(F(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 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 21 place count 59 transition count 61
Applied a total of 21 rules in 8 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:02:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-20 12:02:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 finished in 372 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(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 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 21 place count 59 transition count 61
Applied a total of 21 rules in 4 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-20 12:02:42] [INFO ] Invariant cache hit.
[2023-03-20 12:02:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22337 reset in 116 ms.
Product exploration explored 100000 steps with 22502 reset in 117 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 404 steps, run visited all 1 properties in 6 ms. (steps per millisecond=67 )
Probabilistic random walk after 404 steps, saw 238 distinct states, run finished after 6 ms. (steps per millisecond=67 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
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:02:43] [INFO ] Invariant cache hit.
[2023-03-20 12:02:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:02:43] [INFO ] Invariant cache hit.
[2023-03-20 12:02:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:43] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-20 12:02:43] [INFO ] Invariant cache hit.
[2023-03-20 12:02:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1068 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 404 steps, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
Probabilistic random walk after 404 steps, saw 238 distinct states, run finished after 5 ms. (steps per millisecond=80 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22256 reset in 99 ms.
Product exploration explored 100000 steps with 22435 reset in 97 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
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 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 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:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-08 finished in 2546 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' '!(F(((p1||X(p2))&&p0)))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 61 transition count 63
Applied a total of 17 rules in 6 ms. Remains 61 /69 variables (removed 8) and now considering 63/72 (removed 9) transitions.
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:02:45] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 63/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 61/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s11 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 finished in 285 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' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 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 21 place count 59 transition count 61
Applied a total of 21 rules in 8 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:02:45] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-20 12:02:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:45] [INFO ] Invariant cache hit.
[2023-03-20 12:02:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s19 1)), p0:(AND (GEQ s12 1) (GEQ s46 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22415 reset in 86 ms.
Product exploration explored 100000 steps with 22335 reset in 101 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 1052 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:02:46] [INFO ] Invariant cache hit.
[2023-03-20 12:02:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:02:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:02:46] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-20 12:02:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:46] [INFO ] After 8ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 12:02:46] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 12:02:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:02:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:02:47] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 12:02:47] [INFO ] After 14ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-20 12:02:47] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 12:02:47] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 61/61 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1068 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1178 steps, run visited all 2 properties in 14 ms. (steps per millisecond=84 )
Probabilistic random walk after 1178 steps, saw 572 distinct states, run finished after 14 ms. (steps per millisecond=84 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (OR p1 p0)), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 431 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 85 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:47] [INFO ] Invariant cache hit.
[2023-03-20 12:02:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:02:47] [INFO ] Invariant cache hit.
[2023-03-20 12:02:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-20 12:02:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:47] [INFO ] Invariant cache hit.
[2023-03-20 12:02:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:02:48] [INFO ] Invariant cache hit.
[2023-03-20 12:02:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:02:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:02:48] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:02:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:48] [INFO ] After 21ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:02:48] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:02:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:02:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:02:48] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:02:48] [INFO ] After 5ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:02:48] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 12:02:48] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 61/61 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1178 steps, run visited all 1 properties in 6 ms. (steps per millisecond=196 )
Probabilistic random walk after 1178 steps, saw 572 distinct states, run finished after 6 ms. (steps per millisecond=196 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 97 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 22312 reset in 90 ms.
Product exploration explored 100000 steps with 22342 reset in 90 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-20 12:02:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-12 finished in 4010 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' '!(F(p0))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Applied a total of 18 rules in 4 ms. Remains 60 /69 variables (removed 9) and now considering 63/72 (removed 9) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-20 12:02:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:02:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-20 12:02:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 63/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 60/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 finished in 297 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)&&(p1 U p2)))&&F(((p1 U p2)&&p3))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Applied a total of 18 rules in 3 ms. Remains 60 /69 variables (removed 9) and now considering 63/72 (removed 9) transitions.
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:02:49] [INFO ] Invariant cache hit.
[2023-03-20 12:02:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:02:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-20 12:02:50] [INFO ] Invariant cache hit.
[2023-03-20 12:02:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 63/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 60/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2)), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(OR p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s28 1)), p2:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s46 1)), p0:(OR (LT s1 1) (LT s30 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 finished in 393 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' '!(G(F(!p0)))'
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(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-08
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 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 21 place count 59 transition count 61
Applied a total of 21 rules in 5 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:02:50] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 12:02:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:02:50] [INFO ] Invariant cache hit.
[2023-03-20 12:02:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-20 12:02:50] [INFO ] Invariant cache hit.
[2023-03-20 12:02:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 166 ms. Remains : 59/69 places, 61/72 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22446 reset in 81 ms.
Product exploration explored 100000 steps with 22310 reset in 89 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.0 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1108 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 404 steps, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
Probabilistic random walk after 404 steps, saw 238 distinct states, run finished after 5 ms. (steps per millisecond=80 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
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 0 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:51] [INFO ] Invariant cache hit.
[2023-03-20 12:02:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:02:51] [INFO ] Invariant cache hit.
[2023-03-20 12:02:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-20 12:02:51] [INFO ] Invariant cache hit.
[2023-03-20 12:02:51] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 404 steps, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
Probabilistic random walk after 404 steps, saw 238 distinct states, run finished after 6 ms. (steps per millisecond=67 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22265 reset in 85 ms.
Product exploration explored 100000 steps with 22396 reset in 83 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
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 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:02:52] [INFO ] Invariant cache hit.
[2023-03-20 12:02:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 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 0 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:02:52] [INFO ] Invariant cache hit.
[2023-03-20 12:02:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:02:52] [INFO ] Invariant cache hit.
[2023-03-20 12:02:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:02:52] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-20 12:02:52] [INFO ] Invariant cache hit.
[2023-03-20 12:02:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-08 finished in 2304 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' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
[2023-03-20 12:02:52] [INFO ] Flatten gal took : 5 ms
[2023-03-20 12:02:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 12:02:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 72 transitions and 285 arcs took 1 ms.
Total runtime 19469 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1576/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1576/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1576/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m18-LTLFireability-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m18-LTLFireability-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m18-LTLFireability-12
BK_STOP 1679313773279
--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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-d0m18-LTLFireability-01
ltl formula formula --ltl=/tmp/1576/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 69 places, 72 transitions and 285 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1576/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1576/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1576/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1576/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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-d0m18-LTLFireability-08
ltl formula formula --ltl=/tmp/1576/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
pnml2lts-mc( 0/ 4): Petri net has 69 places, 72 transitions and 285 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
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( 0/ 4): LTL layer: formula: /tmp/1576/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1576/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1576/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1576/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name SieveSingleMsgMbox-PT-d0m18-LTLFireability-12
ltl formula formula --ltl=/tmp/1576/ltl_2_
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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 69 places, 72 transitions and 285 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1576/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1576/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1576/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1576/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-d0m18"
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-d0m18, 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-167905978100372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m18.tgz
mv SieveSingleMsgMbox-PT-d0m18 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 '
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 ;