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-171683823900068.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-d2m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 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 1.1M 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-d2m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716934615031

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-d2m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 22:16:57] [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 22:16:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:16:57] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-28 22:16:57] [INFO ] Transformed 2398 places.
[2024-05-28 22:16:57] [INFO ] Transformed 1954 transitions.
[2024-05-28 22:16:57] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 950 place count 292 transition count 689
Iterating global reduction 1 with 97 rules applied. Total rules applied 1047 place count 292 transition count 689
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1058 place count 292 transition count 678
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 1125 place count 225 transition count 611
Iterating global reduction 2 with 67 rules applied. Total rules applied 1192 place count 225 transition count 611
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1232 place count 225 transition count 571
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1254 place count 203 transition count 546
Iterating global reduction 3 with 22 rules applied. Total rules applied 1276 place count 203 transition count 546
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1337 place count 203 transition count 485
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 198 transition count 477
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 198 transition count 477
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1352 place count 193 transition count 472
Iterating global reduction 4 with 5 rules applied. Total rules applied 1357 place count 193 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1359 place count 191 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 1361 place count 191 transition count 469
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1362 place count 190 transition count 468
Iterating global reduction 4 with 1 rules applied. Total rules applied 1363 place count 190 transition count 468
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1364 place count 189 transition count 467
Iterating global reduction 4 with 1 rules applied. Total rules applied 1365 place count 189 transition count 467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1366 place count 188 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 1367 place count 188 transition count 466
Applied a total of 1367 rules in 220 ms. Remains 188 /414 variables (removed 226) and now considering 466/1954 (removed 1488) transitions.
// Phase 1: matrix 466 rows 188 cols
[2024-05-28 22:16:58] [INFO ] Computed 5 invariants in 47 ms
[2024-05-28 22:16:59] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-28 22:16:59] [INFO ] Invariant cache hit.
[2024-05-28 22:16:59] [INFO ] State equation strengthened by 320 read => feed constraints.
[2024-05-28 22:17:00] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-05-28 22:17:00] [INFO ] Invariant cache hit.
[2024-05-28 22:17:00] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/414 places, 466/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2644 ms. Remains : 188/414 places, 466/1954 transitions.
Support contains 33 out of 188 places after structural reductions.
[2024-05-28 22:17:01] [INFO ] Flatten gal took : 143 ms
[2024-05-28 22:17:01] [INFO ] Flatten gal took : 74 ms
[2024-05-28 22:17:01] [INFO ] Input system was already deterministic with 466 transitions.
Support contains 31 out of 188 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 248730 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 17=1, 19=1, 20=1, 23=1, 24=1, 25=1}
Probabilistic random walk after 248730 steps, saw 101670 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :21
Running SMT prover for 5 properties.
[2024-05-28 22:17:06] [INFO ] Invariant cache hit.
[2024-05-28 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:17:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 22:17:06] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-28 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:17:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 22:17:07] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-28 22:17:07] [INFO ] State equation strengthened by 320 read => feed constraints.
[2024-05-28 22:17:07] [INFO ] After 329ms SMT Verify possible using 320 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-28 22:17:07] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 6 ms to minimize.
[2024-05-28 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-28 22:17:07] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 406 ms.
[2024-05-28 22:17:08] [INFO ] After 1753ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 466/466 transitions.
Graph (complete) has 763 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 187 transition count 464
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 162 transition count 227
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 162 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 162 transition count 222
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 79 place count 141 transition count 199
Iterating global reduction 2 with 21 rules applied. Total rules applied 100 place count 141 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 141 transition count 191
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 122 place count 127 transition count 168
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 127 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 147 place count 127 transition count 157
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 151 place count 123 transition count 153
Iterating global reduction 4 with 4 rules applied. Total rules applied 155 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 120 transition count 150
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 120 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 118 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 118 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 118 transition count 146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 117 transition count 145
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 117 transition count 145
Applied a total of 169 rules in 67 ms. Remains 117 /188 variables (removed 71) and now considering 145/466 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 117/188 places, 145/466 transitions.
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Probably explored full state space saw : 96031 states, properties seen :1
Probabilistic random walk after 237000 steps, saw 96031 distinct states, run finished after 1013 ms. (steps per millisecond=233 ) properties seen :1
Explored full state space saw : 96038 states, properties seen :0
Exhaustive walk after 237016 steps, saw 96038 distinct states, run finished after 1222 ms. (steps per millisecond=193 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 42 stabilizing places and 72 stable transitions
Graph (complete) has 829 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G((p0||X(F(!p1))))) U p2)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 239
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 163 transition count 235
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 142 transition count 212
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 142 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 103 place count 142 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 128 transition count 183
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 128 transition count 183
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 141 place count 128 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 124 transition count 169
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 124 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 120 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 120 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 117 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 117 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 166 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 115 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 114 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 113 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 113 transition count 153
Applied a total of 174 rules in 62 ms. Remains 113 /188 variables (removed 75) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 113 cols
[2024-05-28 22:17:11] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 22:17:11] [INFO ] Invariant cache hit.
[2024-05-28 22:17:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:17:11] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-28 22:17:11] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 22:17:11] [INFO ] Invariant cache hit.
[2024-05-28 22:17:12] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/188 places, 153/466 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 113/188 places, 153/466 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 333 ms :[(NOT p2), (AND (NOT p0) p1), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s108 1)), p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 finished in 985 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)) U p1)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 238
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 162 transition count 234
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 140 transition count 210
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 140 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 140 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 125 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 125 transition count 181
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 149 place count 125 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 121 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 121 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 170 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 112 transition count 153
Applied a total of 175 rules in 24 ms. Remains 112 /188 variables (removed 76) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 112 cols
[2024-05-28 22:17:12] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:12] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 22:17:12] [INFO ] Invariant cache hit.
[2024-05-28 22:17:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:17:12] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-28 22:17:12] [INFO ] Invariant cache hit.
[2024-05-28 22:17:12] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/188 places, 153/466 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 112/188 places, 153/466 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 finished in 713 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))||(F(p1)&&X(!p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 238
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 162 transition count 234
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 140 transition count 210
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 140 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 140 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 125 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 125 transition count 181
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 149 place count 125 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 121 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 121 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 170 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 112 transition count 153
Applied a total of 175 rules in 20 ms. Remains 112 /188 variables (removed 76) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 112 cols
[2024-05-28 22:17:13] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 22:17:13] [INFO ] Invariant cache hit.
[2024-05-28 22:17:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:17:13] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-28 22:17:13] [INFO ] Invariant cache hit.
[2024-05-28 22:17:13] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/188 places, 153/466 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 112/188 places, 153/466 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s107 1)), p1:(OR (LT s1 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22491 reset in 306 ms.
Product exploration explored 100000 steps with 22448 reset in 310 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 379 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2203 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57855 steps, run visited all 1 properties in 131 ms. (steps per millisecond=441 )
Probabilistic random walk after 57855 steps, saw 24939 distinct states, run finished after 132 ms. (steps per millisecond=438 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 190 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 153/153 transitions.
Applied a total of 0 rules in 11 ms. Remains 112 /112 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2024-05-28 22:17:15] [INFO ] Invariant cache hit.
[2024-05-28 22:17:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:17:15] [INFO ] Invariant cache hit.
[2024-05-28 22:17:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 22:17:15] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-28 22:17:15] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 22:17:15] [INFO ] Invariant cache hit.
[2024-05-28 22:17:15] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 112/112 places, 153/153 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 379 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57855 steps, run visited all 1 properties in 105 ms. (steps per millisecond=551 )
Probabilistic random walk after 57855 steps, saw 24939 distinct states, run finished after 106 ms. (steps per millisecond=545 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22445 reset in 167 ms.
Product exploration explored 100000 steps with 22270 reset in 340 ms.
Built C files in :
/tmp/ltsmin10416916186524071934
[2024-05-28 22:17:16] [INFO ] Computing symmetric may disable matrix : 153 transitions.
[2024-05-28 22:17:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:17:16] [INFO ] Computing symmetric may enable matrix : 153 transitions.
[2024-05-28 22:17:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:17:16] [INFO ] Computing Do-Not-Accords matrix : 153 transitions.
[2024-05-28 22:17:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:17:16] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416916186524071934
Running compilation step : cd /tmp/ltsmin10416916186524071934;'/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 619 ms.
Running link step : cd /tmp/ltsmin10416916186524071934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10416916186524071934;'/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/stateBased8930828416960465910.hoa' '--buchi-type=spotba'
LTSmin run took 3399 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 finished in 7975 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 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 225
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 162 transition count 222
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 140 transition count 199
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 140 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 140 transition count 191
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 122 place count 125 transition count 167
Iterating global reduction 2 with 15 rules applied. Total rules applied 137 place count 125 transition count 167
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 150 place count 125 transition count 154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 121 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 121 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 117 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 115 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 115 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 114 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 114 transition count 141
Applied a total of 174 rules in 37 ms. Remains 114 /188 variables (removed 74) and now considering 141/466 (removed 325) transitions.
// Phase 1: matrix 141 rows 114 cols
[2024-05-28 22:17:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:17:21] [INFO ] Invariant cache hit.
[2024-05-28 22:17:21] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 22:17:21] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-28 22:17:21] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 22:17:21] [INFO ] Invariant cache hit.
[2024-05-28 22:17:21] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/188 places, 141/466 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 114/188 places, 141/466 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s109 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 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 finished in 559 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)&&F((G(p1)||G(F(p2)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 228
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 163 transition count 225
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 75 place count 141 transition count 201
Iterating global reduction 1 with 22 rules applied. Total rules applied 97 place count 141 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 141 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 126 transition count 169
Iterating global reduction 2 with 15 rules applied. Total rules applied 135 place count 126 transition count 169
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 147 place count 126 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 121 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 121 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 115 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 114 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 114 transition count 143
Applied a total of 173 rules in 33 ms. Remains 114 /188 variables (removed 74) and now considering 143/466 (removed 323) transitions.
// Phase 1: matrix 143 rows 114 cols
[2024-05-28 22:17:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 22:17:21] [INFO ] Invariant cache hit.
[2024-05-28 22:17:21] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 22:17:22] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-28 22:17:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 22:17:22] [INFO ] Invariant cache hit.
[2024-05-28 22:17:22] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/188 places, 143/466 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 114/188 places, 143/466 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s108 1)), p1:(AND (GEQ s1 1) (GEQ s111 1)), p2:(AND (GEQ s1 1) (GEQ s60 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 finished in 679 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(p0)||G(p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 213
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 162 transition count 210
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 79 place count 138 transition count 184
Iterating global reduction 1 with 24 rules applied. Total rules applied 103 place count 138 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 111 place count 138 transition count 176
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 127 place count 122 transition count 151
Iterating global reduction 2 with 16 rules applied. Total rules applied 143 place count 122 transition count 151
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 154 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 118 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 118 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 114 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 112 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 111 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 111 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 110 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 109 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 109 transition count 125
Applied a total of 180 rules in 31 ms. Remains 109 /188 variables (removed 79) and now considering 125/466 (removed 341) transitions.
// Phase 1: matrix 125 rows 109 cols
[2024-05-28 22:17:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:22] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 22:17:22] [INFO ] Invariant cache hit.
[2024-05-28 22:17:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:17:22] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-28 22:17:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:17:22] [INFO ] Invariant cache hit.
[2024-05-28 22:17:22] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/188 places, 125/466 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 109/188 places, 125/466 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s24 1) (GEQ s69 1)), p1:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 finished in 585 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(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 161 transition count 224
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 161 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 161 transition count 220
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 138 transition count 195
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 138 transition count 195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 112 place count 138 transition count 187
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 128 place count 122 transition count 162
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 122 transition count 162
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 157 place count 122 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 117 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 117 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 172 place count 112 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 177 place count 112 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 109 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 109 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 109 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 107 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 105 transition count 128
Applied a total of 193 rules in 17 ms. Remains 105 /188 variables (removed 83) and now considering 128/466 (removed 338) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-28 22:17:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 22:17:23] [INFO ] Invariant cache hit.
[2024-05-28 22:17:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:17:23] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-28 22:17:23] [INFO ] Invariant cache hit.
[2024-05-28 22:17:23] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/188 places, 128/466 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 105/188 places, 128/466 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 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:(AND (GEQ s1 1) (GEQ s100 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 finished in 583 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(!p0)||G(((p2||X(p3))&&p1))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 164 transition count 266
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 164 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 164 transition count 262
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 144 transition count 240
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 144 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 98 place count 144 transition count 234
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 130 transition count 213
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 130 transition count 213
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 140 place count 130 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 127 transition count 196
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 127 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 124 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 124 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 122 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 122 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 121 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 120 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 120 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 119 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 119 transition count 186
Applied a total of 162 rules in 21 ms. Remains 119 /188 variables (removed 69) and now considering 186/466 (removed 280) transitions.
// Phase 1: matrix 186 rows 119 cols
[2024-05-28 22:17:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 22:17:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:17:23] [INFO ] Invariant cache hit.
[2024-05-28 22:17:23] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-28 22:17:24] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-28 22:17:24] [INFO ] Invariant cache hit.
[2024-05-28 22:17:24] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/188 places, 186/466 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 119/188 places, 186/466 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s112 1)), p2:(AND (GEQ s1 1) (GEQ s114 1)), p0:(AND (GEQ s1 1) (GEQ s113 1)), p3:(AND (GEQ s1 1) (GEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22443 reset in 283 ms.
Product exploration explored 100000 steps with 22515 reset in 307 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 424 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p1) (NOT p3))), (X (NOT (AND p1 p2 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p1)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 40 factoid took 257 ms. Reduced automaton from 6 states, 21 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, p0]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 160877 steps, run visited all 1 properties in 307 ms. (steps per millisecond=524 )
Probabilistic random walk after 160877 steps, saw 67909 distinct states, run finished after 311 ms. (steps per millisecond=517 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p1) (NOT p3))), (X (NOT (AND p1 p2 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT p1)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 40 factoid took 415 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 finished in 2595 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(p0))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 160 transition count 210
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 160 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 160 transition count 206
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 136 transition count 180
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 136 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 136 transition count 172
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 132 place count 120 transition count 147
Iterating global reduction 2 with 16 rules applied. Total rules applied 148 place count 120 transition count 147
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 160 place count 120 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 165 place count 115 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 170 place count 115 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 110 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 107 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 107 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 107 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 105 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 103 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 103 transition count 115
Applied a total of 195 rules in 28 ms. Remains 103 /188 variables (removed 85) and now considering 115/466 (removed 351) transitions.
// Phase 1: matrix 115 rows 103 cols
[2024-05-28 22:17:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 22:17:26] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 22:17:26] [INFO ] Invariant cache hit.
[2024-05-28 22:17:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 22:17:26] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-28 22:17:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 22:17:26] [INFO ] Invariant cache hit.
[2024-05-28 22:17:26] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/188 places, 115/466 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 103/188 places, 115/466 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s92 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 finished in 496 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) U X((p1&&X(F(p2)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 163 transition count 236
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 142 transition count 213
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 142 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 104 place count 142 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 128 transition count 183
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 128 transition count 183
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 144 place count 128 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 125 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 125 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 122 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 122 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 120 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 120 transition count 163
Applied a total of 160 rules in 15 ms. Remains 120 /188 variables (removed 68) and now considering 163/466 (removed 303) transitions.
// Phase 1: matrix 163 rows 120 cols
[2024-05-28 22:17:26] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 22:17:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:17:26] [INFO ] Invariant cache hit.
[2024-05-28 22:17:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-28 22:17:27] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-28 22:17:27] [INFO ] Invariant cache hit.
[2024-05-28 22:17:27] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/188 places, 163/466 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 120/188 places, 163/466 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s115 1)), p1:(OR (AND (GEQ s1 1) (GEQ s114 1)) (AND (GEQ s1 1) (GEQ s62 1))), p2:(AND (GEQ s1 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 finished in 813 ms.
All properties solved by simple procedures.
Total runtime 29997 ms.

BK_STOP 1716934648233

--------------------
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-d2m06"
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-d2m06, 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-171683823900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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