Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823800038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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-d1m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716918236762

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 17:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:44:00] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2024-05-28 17:44:00] [INFO ] Transformed 1295 places.
[2024-05-28 17:44:00] [INFO ] Transformed 749 transitions.
[2024-05-28 17:44:00] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 19 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 300 place count 199 transition count 414
Iterating global reduction 1 with 43 rules applied. Total rules applied 343 place count 199 transition count 414
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 349 place count 199 transition count 408
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 374 place count 174 transition count 383
Iterating global reduction 2 with 25 rules applied. Total rules applied 399 place count 174 transition count 383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 408 place count 174 transition count 374
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 421 place count 161 transition count 360
Iterating global reduction 3 with 13 rules applied. Total rules applied 434 place count 161 transition count 360
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 494 place count 161 transition count 300
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 496 place count 159 transition count 296
Iterating global reduction 4 with 2 rules applied. Total rules applied 498 place count 159 transition count 296
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 500 place count 157 transition count 294
Iterating global reduction 4 with 2 rules applied. Total rules applied 502 place count 157 transition count 294
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 503 place count 156 transition count 293
Iterating global reduction 4 with 1 rules applied. Total rules applied 504 place count 156 transition count 293
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 505 place count 155 transition count 292
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 155 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 507 place count 154 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 154 transition count 291
Applied a total of 508 rules in 184 ms. Remains 154 /259 variables (removed 105) and now considering 291/749 (removed 458) transitions.
// Phase 1: matrix 291 rows 154 cols
[2024-05-28 17:44:01] [INFO ] Computed 5 invariants in 27 ms
[2024-05-28 17:44:01] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-28 17:44:01] [INFO ] Invariant cache hit.
[2024-05-28 17:44:01] [INFO ] State equation strengthened by 184 read => feed constraints.
[2024-05-28 17:44:02] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2024-05-28 17:44:02] [INFO ] Invariant cache hit.
[2024-05-28 17:44:03] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/259 places, 291/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2196 ms. Remains : 154/259 places, 291/749 transitions.
Support contains 28 out of 154 places after structural reductions.
[2024-05-28 17:44:03] [INFO ] Flatten gal took : 107 ms
[2024-05-28 17:44:03] [INFO ] Flatten gal took : 48 ms
[2024-05-28 17:44:03] [INFO ] Input system was already deterministic with 291 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 952 ms. (steps per millisecond=10 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 254651 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 14=1, 15=1, 17=1, 18=1, 19=1, 20=1, 21=1, 23=1}
Probabilistic random walk after 254651 steps, saw 101890 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :19
Running SMT prover for 5 properties.
[2024-05-28 17:44:08] [INFO ] Invariant cache hit.
[2024-05-28 17:44:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:44:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 17:44:08] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-28 17:44:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 17:44:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 17:44:09] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-28 17:44:09] [INFO ] State equation strengthened by 184 read => feed constraints.
[2024-05-28 17:44:09] [INFO ] After 353ms SMT Verify possible using 184 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-28 17:44:09] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 551 ms.
[2024-05-28 17:44:10] [INFO ] After 1715ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 291/291 transitions.
Graph (complete) has 530 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 153 transition count 289
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 135 transition count 167
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 135 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 135 transition count 165
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 57 place count 119 transition count 149
Iterating global reduction 2 with 16 rules applied. Total rules applied 73 place count 119 transition count 149
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 119 transition count 140
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 91 place count 110 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 100 place count 110 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 105 place count 110 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 106 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 106 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 103 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 103 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 101 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 101 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 101 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 127 place count 99 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 99 transition count 112
Applied a total of 129 rules in 83 ms. Remains 99 /154 variables (removed 55) and now considering 112/291 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 99/154 places, 112/291 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Probably explored full state space saw : 52353 states, properties seen :3
Probabilistic random walk after 130624 steps, saw 52353 distinct states, run finished after 1253 ms. (steps per millisecond=104 ) properties seen :3
Explored full state space saw : 52353 states, properties seen :0
Exhaustive walk after 130624 steps, saw 52353 distinct states, run finished after 216 ms. (steps per millisecond=604 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 42 stabilizing places and 69 stable transitions
Graph (complete) has 588 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 134 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 134 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 134 transition count 168
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 116 transition count 149
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 116 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 116 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 105 transition count 129
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 105 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 115 place count 105 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 101 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 101 transition count 119
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 97 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 97 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 95 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 95 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 95 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 93 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 93 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 92 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 91 transition count 106
Applied a total of 145 rules in 43 ms. Remains 91 /154 variables (removed 63) and now considering 106/291 (removed 185) transitions.
// Phase 1: matrix 106 rows 91 cols
[2024-05-28 17:44:13] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 17:44:13] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 17:44:13] [INFO ] Invariant cache hit.
[2024-05-28 17:44:13] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 17:44:13] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-28 17:44:13] [INFO ] Invariant cache hit.
[2024-05-28 17:44:13] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/154 places, 106/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 91/154 places, 106/291 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(OR (LT s13 1) (LT s27 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 finished in 921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 134 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 134 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 134 transition count 168
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 116 transition count 149
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 116 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 116 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 105 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 105 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 105 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 100 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 100 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 96 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 96 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 93 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 93 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 143 place count 90 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 146 place count 90 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 88 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 87 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 87 transition count 103
Applied a total of 152 rules in 28 ms. Remains 87 /154 variables (removed 67) and now considering 103/291 (removed 188) transitions.
// Phase 1: matrix 103 rows 87 cols
[2024-05-28 17:44:14] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 17:44:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 17:44:14] [INFO ] Invariant cache hit.
[2024-05-28 17:44:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 17:44:14] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-28 17:44:14] [INFO ] Invariant cache hit.
[2024-05-28 17:44:14] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/154 places, 103/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 87/154 places, 103/291 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s66 1)), p0:(OR (LT s1 1) (LT s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 561 ms.
Product exploration explored 100000 steps with 33333 reset in 353 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 280 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 finished in 1659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 135 transition count 171
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 117 transition count 153
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 117 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 83 place count 117 transition count 145
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 106 transition count 133
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 106 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 106 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 102 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 99 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 99 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 97 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 97 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 97 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 133 place count 95 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 95 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 94 transition count 112
Applied a total of 137 rules in 50 ms. Remains 94 /154 variables (removed 60) and now considering 112/291 (removed 179) transitions.
// Phase 1: matrix 112 rows 94 cols
[2024-05-28 17:44:15] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:44:16] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-28 17:44:16] [INFO ] Invariant cache hit.
[2024-05-28 17:44:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 17:44:16] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-28 17:44:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 17:44:16] [INFO ] Invariant cache hit.
[2024-05-28 17:44:16] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/154 places, 112/291 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 738 ms. Remains : 94/154 places, 112/291 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(AND (GEQ s1 1) (GEQ s93 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 133 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 133 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 133 transition count 167
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 115 transition count 148
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 115 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 115 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 99 place count 104 transition count 129
Iterating global reduction 2 with 11 rules applied. Total rules applied 110 place count 104 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 97 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 97 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 95 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 95 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 93 transition count 111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 91 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 91 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 90 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 90 transition count 108
Applied a total of 143 rules in 21 ms. Remains 90 /154 variables (removed 64) and now considering 108/291 (removed 183) transitions.
// Phase 1: matrix 108 rows 90 cols
[2024-05-28 17:44:16] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:44:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 17:44:16] [INFO ] Invariant cache hit.
[2024-05-28 17:44:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 17:44:16] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-28 17:44:16] [INFO ] Invariant cache hit.
[2024-05-28 17:44:17] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/154 places, 108/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 90/154 places, 108/291 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s85 1) (AND (GEQ s18 1) (GEQ s59 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 306 ms.
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 290 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 finished in 1270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 133 transition count 164
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 133 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 133 transition count 160
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 114 transition count 140
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 114 transition count 140
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 114 transition count 131
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 102 transition count 118
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 102 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 102 transition count 112
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 129 place count 96 transition count 106
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 93 transition count 103
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 93 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 91 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 91 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 89 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 88 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 88 transition count 96
Applied a total of 152 rules in 15 ms. Remains 88 /154 variables (removed 66) and now considering 96/291 (removed 195) transitions.
// Phase 1: matrix 96 rows 88 cols
[2024-05-28 17:44:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:44:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 17:44:17] [INFO ] Invariant cache hit.
[2024-05-28 17:44:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 17:44:18] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-28 17:44:18] [INFO ] Invariant cache hit.
[2024-05-28 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/154 places, 96/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 88/154 places, 96/291 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s52 1)), p0:(OR (LT s21 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((G(p1) U G(p2))||p0)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 188
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 135 transition count 185
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 118 transition count 167
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 118 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 118 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 107 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 107 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 107 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 103 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 100 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 100 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 98 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 96 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 96 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 94 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 93 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 93 transition count 127
Applied a total of 137 rules in 19 ms. Remains 93 /154 variables (removed 61) and now considering 127/291 (removed 164) transitions.
// Phase 1: matrix 127 rows 93 cols
[2024-05-28 17:44:18] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:44:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 17:44:18] [INFO ] Invariant cache hit.
[2024-05-28 17:44:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 17:44:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-28 17:44:18] [INFO ] Invariant cache hit.
[2024-05-28 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/154 places, 127/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 93/154 places, 127/291 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s88 1)), p0:(OR (LT s1 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 265 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 313 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(F(p1))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 134 transition count 179
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 134 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 134 transition count 176
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 116 transition count 157
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 116 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 116 transition count 150
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 97 place count 105 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 108 place count 105 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 101 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 101 transition count 129
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 98 transition count 126
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 98 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 95 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 95 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 92 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 90 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 89 transition count 112
Applied a total of 148 rules in 19 ms. Remains 89 /154 variables (removed 65) and now considering 112/291 (removed 179) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-28 17:44:19] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:44:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 17:44:19] [INFO ] Invariant cache hit.
[2024-05-28 17:44:19] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 17:44:20] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-28 17:44:20] [INFO ] Invariant cache hit.
[2024-05-28 17:44:20] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/154 places, 112/291 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 89/154 places, 112/291 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s84 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22367 reset in 227 ms.
Product exploration explored 100000 steps with 22474 reset in 254 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3841 steps, run visited all 2 properties in 23 ms. (steps per millisecond=167 )
Probabilistic random walk after 3841 steps, saw 1744 distinct states, run finished after 23 ms. (steps per millisecond=167 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 112/112 transitions.
Applied a total of 0 rules in 15 ms. Remains 89 /89 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-28 17:44:22] [INFO ] Invariant cache hit.
[2024-05-28 17:44:22] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 17:44:22] [INFO ] Invariant cache hit.
[2024-05-28 17:44:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 17:44:22] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-28 17:44:22] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 17:44:22] [INFO ] Invariant cache hit.
[2024-05-28 17:44:22] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 89/89 places, 112/112 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3841 steps, run visited all 2 properties in 28 ms. (steps per millisecond=137 )
Probabilistic random walk after 3841 steps, saw 1744 distinct states, run finished after 28 ms. (steps per millisecond=137 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22530 reset in 130 ms.
Product exploration explored 100000 steps with 22297 reset in 146 ms.
Built C files in :
/tmp/ltsmin14574720189583798905
[2024-05-28 17:44:24] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-05-28 17:44:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:44:24] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-05-28 17:44:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:44:24] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-05-28 17:44:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:44:24] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14574720189583798905
Running compilation step : cd /tmp/ltsmin14574720189583798905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 541 ms.
Running link step : cd /tmp/ltsmin14574720189583798905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14574720189583798905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9271924091764340440.hoa' '--buchi-type=spotba'
LTSmin run took 579 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 finished in 5695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 291/291 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 133 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 133 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 133 transition count 167
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 114 transition count 147
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 114 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 91 place count 114 transition count 139
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 102 transition count 126
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 102 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 102 transition count 120
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 97 transition count 115
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 97 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 93 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 93 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 90 transition count 105
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 150 place count 87 transition count 101
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 84 transition count 98
Applied a total of 159 rules in 50 ms. Remains 84 /154 variables (removed 70) and now considering 98/291 (removed 193) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 17:44:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:44:25] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-28 17:44:25] [INFO ] Invariant cache hit.
[2024-05-28 17:44:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 17:44:25] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-28 17:44:25] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 17:44:25] [INFO ] Invariant cache hit.
[2024-05-28 17:44:26] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/154 places, 98/291 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 657 ms. Remains : 84/154 places, 98/291 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 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 s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 finished in 859 ms.
All properties solved by simple procedures.
Total runtime 26120 ms.

BK_STOP 1716918267237

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r395-smll-171683823800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m06.tgz
mv SieveSingleMsgMbox-PT-d1m06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;