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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 19:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:19 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 57K 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-d0m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716916639337

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-d0m96
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 17:17:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:17:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:17:22] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-28 17:17:22] [INFO ] Transformed 262 places.
[2024-05-28 17:17:22] [INFO ] Transformed 73 transitions.
[2024-05-28 17:17:22] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 23 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-05-28 17:17:22] [INFO ] Computed 5 invariants in 8 ms
[2024-05-28 17:17:22] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-28 17:17:22] [INFO ] Invariant cache hit.
[2024-05-28 17:17:22] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 17:17:22] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-28 17:17:22] [INFO ] Invariant cache hit.
[2024-05-28 17:17:22] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 73/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 33 out of 70 places after structural reductions.
[2024-05-28 17:17:23] [INFO ] Flatten gal took : 37 ms
[2024-05-28 17:17:23] [INFO ] Flatten gal took : 19 ms
[2024-05-28 17:17:23] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 32 out of 70 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 32) seen :9
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 117 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2024-05-28 17:17:24] [INFO ] Invariant cache hit.
[2024-05-28 17:17:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 17:17:24] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :4 sat :1 real:16
[2024-05-28 17:17:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 17:17:24] [INFO ] After 20ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :4 sat :0 real:17
[2024-05-28 17:17:24] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:17
[2024-05-28 17:17:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:25] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :17
[2024-05-28 17:17:25] [INFO ] After 174ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :4 sat :17
[2024-05-28 17:17:25] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 7 ms to minimize.
[2024-05-28 17:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 17:17:25] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :17
Attempting to minimize the solution found.
Minimization took 170 ms.
[2024-05-28 17:17:25] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :17
Fused 21 Parikh solutions to 17 different solutions.
Parikh walk visited 4 properties in 478 ms.
Support contains 15 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 68 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 67 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 67 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 66 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 66 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 66 transition count 68
Applied a total of 9 rules in 22 ms. Remains 66 /70 variables (removed 4) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 66/70 places, 68/73 transitions.
Incomplete random walk after 10000 steps, including 2202 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 302 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1077 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 68 rows 66 cols
[2024-05-28 17:17:27] [INFO ] Computed 5 invariants in 14 ms
[2024-05-28 17:17:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 17:17:27] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-28 17:17:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:28] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-28 17:17:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 17:17:28] [INFO ] After 81ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-28 17:17:28] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 17:17:28] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-28 17:17:28] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 3 properties in 203 ms.
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 68/68 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 64 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 64 transition count 66
Applied a total of 4 rules in 9 ms. Remains 64 /66 variables (removed 2) and now considering 66/68 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 64/66 places, 66/68 transitions.
Incomplete random walk after 10000 steps, including 2200 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 312 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1062 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 2668484 steps, run timeout after 3001 ms. (steps per millisecond=889 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 2668484 steps, saw 1323167 distinct states, run finished after 3002 ms. (steps per millisecond=888 ) properties seen :6
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 64 cols
[2024-05-28 17:17:32] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 17:17:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:32] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:17:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:32] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 17:17:32] [INFO ] After 12ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:32] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 17:17:32] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 66/66 transitions.
Graph (complete) has 171 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 60 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 60 transition count 61
Applied a total of 9 rules in 11 ms. Remains 60 /64 variables (removed 4) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 60/64 places, 61/66 transitions.
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2967202 steps, run timeout after 3001 ms. (steps per millisecond=988 ) properties seen :{}
Probabilistic random walk after 2967202 steps, saw 1526374 distinct states, run finished after 3002 ms. (steps per millisecond=988 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 60 cols
[2024-05-28 17:17:35] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 17:17:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:35] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:17:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:35] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:17:35] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 17:17:35] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-28 17:17:35] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 17:17:35] [INFO ] Invariant cache hit.
[2024-05-28 17:17:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 17:17:36] [INFO ] Invariant cache hit.
[2024-05-28 17:17:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:17:36] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-28 17:17:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 17:17:36] [INFO ] Invariant cache hit.
[2024-05-28 17:17:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 60/60 places, 61/61 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 60
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 1 place count 60 transition count 50
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 21 place count 50 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 47 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 44 transition count 47
Applied a total of 33 rules in 19 ms. Remains 44 /60 variables (removed 16) and now considering 47/61 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 44 cols
[2024-05-28 17:17:36] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:17:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 17:17:36] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:17:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 17:17:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 17:17:36] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 17:17:36] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-28 17:17:36] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 213 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-03 FALSE 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' '!(X((F(p0)||G((G(p0)||X(p1))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 10 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:17:36] [INFO ] Computed 5 invariants in 25 ms
[2024-05-28 17:17:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 17:17:37] [INFO ] Invariant cache hit.
[2024-05-28 17:17:37] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 17:17:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-28 17:17:37] [INFO ] Invariant cache hit.
[2024-05-28 17:17:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 60/70 places, 62/73 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 305 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s27 1)), p1:(OR (LT s1 1) (LT s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 finished in 1334 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 G((p1 U p2))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 18 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:17:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:17:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 17:17:38] [INFO ] Invariant cache hit.
[2024-05-28 17:17:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:17:38] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 17:17:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 17:17:38] [INFO ] Invariant cache hit.
[2024-05-28 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s15 1) (GEQ s19 1)), p1:(AND (GEQ s12 1) (GEQ s47 1)), p0:(AND (GEQ s4 1) (GEQ s19 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 45 steps with 18 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-01 finished in 455 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)&&X((F(p1)&&G((p2 U !p0))))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 7 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 17:17:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:17:38] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 17:17:38] [INFO ] Invariant cache hit.
[2024-05-28 17:17:38] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:17:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-28 17:17:38] [INFO ] Invariant cache hit.
[2024-05-28 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 61/70 places, 63/73 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (OR (NOT p1) p0), true, (NOT p1), p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(OR (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s24 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p1:(OR (LT s8 1) (LT s41 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-02 finished in 642 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 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:17:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:17:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 17:17:39] [INFO ] Invariant cache hit.
[2024-05-28 17:17:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 17:17:39] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-28 17:17:39] [INFO ] Invariant cache hit.
[2024-05-28 17:17:39] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-04 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 s41 1) (GEQ s37 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-d0m96-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-04 finished in 484 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)||F(G((p1 U !p2)))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 11 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:17:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:17:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 17:17:39] [INFO ] Invariant cache hit.
[2024-05-28 17:17:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:17:39] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 17:17:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 17:17:40] [INFO ] Invariant cache hit.
[2024-05-28 17:17:40] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), p2, p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1)), p2:(AND (GEQ s1 1) (GEQ s30 1)), p1:(AND (GEQ s14 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22321 reset in 851 ms.
Product exploration explored 100000 steps with 22380 reset in 222 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 120 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p2, p2]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2682237 steps, run timeout after 3001 ms. (steps per millisecond=893 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2682237 steps, saw 1368662 distinct states, run finished after 3001 ms. (steps per millisecond=893 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 17:17:45] [INFO ] Invariant cache hit.
[2024-05-28 17:17:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:17:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:17:45] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 191 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p2]
Stuttering acceptance computed with spot in 41 ms :[p2]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 17:17:45] [INFO ] Invariant cache hit.
[2024-05-28 17:17:45] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 17:17:45] [INFO ] Invariant cache hit.
[2024-05-28 17:17:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:17:46] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-28 17:17:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 17:17:46] [INFO ] Invariant cache hit.
[2024-05-28 17:17:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p2]
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 305 steps, run visited all 1 properties in 4 ms. (steps per millisecond=76 )
Probabilistic random walk after 305 steps, saw 166 distinct states, run finished after 5 ms. (steps per millisecond=61 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p2]
Stuttering acceptance computed with spot in 33 ms :[p2]
Stuttering acceptance computed with spot in 35 ms :[p2]
Product exploration explored 100000 steps with 22379 reset in 148 ms.
Product exploration explored 100000 steps with 22479 reset in 177 ms.
Built C files in :
/tmp/ltsmin12602312590915265646
[2024-05-28 17:17:47] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-28 17:17:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:17:47] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-28 17:17:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:17:47] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-28 17:17:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:17:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12602312590915265646
Running compilation step : cd /tmp/ltsmin12602312590915265646;'/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 395 ms.
Running link step : cd /tmp/ltsmin12602312590915265646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12602312590915265646;'/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/stateBased14170623665640740061.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 17:18:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:18:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 17:18:02] [INFO ] Invariant cache hit.
[2024-05-28 17:18:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:18:02] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 17:18:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 17:18:02] [INFO ] Invariant cache hit.
[2024-05-28 17:18:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 59/60 places, 61/62 transitions.
Built C files in :
/tmp/ltsmin7570009568396971424
[2024-05-28 17:18:02] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-28 17:18:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:02] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-28 17:18:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:02] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-28 17:18:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7570009568396971424
Running compilation step : cd /tmp/ltsmin7570009568396971424;'/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 204 ms.
Running link step : cd /tmp/ltsmin7570009568396971424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7570009568396971424;'/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/stateBased18327206879550815716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 17:18:17] [INFO ] Flatten gal took : 9 ms
[2024-05-28 17:18:17] [INFO ] Flatten gal took : 14 ms
[2024-05-28 17:18:17] [INFO ] Time to serialize gal into /tmp/LTL12006384239787406398.gal : 3 ms
[2024-05-28 17:18:17] [INFO ] Time to serialize properties into /tmp/LTL10824005577415890043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12006384239787406398.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7242260366314034716.hoa' '-atoms' '/tmp/LTL10824005577415890043.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10824005577415890043.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7242260366314034716.hoa
Detected timeout of ITS tools.
[2024-05-28 17:18:32] [INFO ] Flatten gal took : 8 ms
[2024-05-28 17:18:32] [INFO ] Flatten gal took : 7 ms
[2024-05-28 17:18:32] [INFO ] Time to serialize gal into /tmp/LTL842259820514356341.gal : 2 ms
[2024-05-28 17:18:32] [INFO ] Time to serialize properties into /tmp/LTL14869475499317394623.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL842259820514356341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14869475499317394623.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((s1>=1)&&(l234>=1))"))||(F(G(("((p17>=1)&&(l0>=1))")U(!("((s1>=1)&&(l55>=1))")))))))
Formula 0 simplified : F!"((s1>=1)&&(l234>=1))" & GF(!"((p17>=1)&&(l0>=1))" R "((s1>=1)&&(l55>=1))")
Detected timeout of ITS tools.
[2024-05-28 17:18:47] [INFO ] Flatten gal took : 7 ms
[2024-05-28 17:18:47] [INFO ] Applying decomposition
[2024-05-28 17:18:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5925254314065591682.txt' '-o' '/tmp/graph5925254314065591682.bin' '-w' '/tmp/graph5925254314065591682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5925254314065591682.bin' '-l' '-1' '-v' '-w' '/tmp/graph5925254314065591682.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:18:47] [INFO ] Decomposing Gal with order
[2024-05-28 17:18:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:18:47] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-28 17:18:48] [INFO ] Flatten gal took : 50 ms
[2024-05-28 17:18:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 7 ms.
[2024-05-28 17:18:48] [INFO ] Time to serialize gal into /tmp/LTL11372930426491571772.gal : 3 ms
[2024-05-28 17:18:48] [INFO ] Time to serialize properties into /tmp/LTL8147767413688667631.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11372930426491571772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8147767413688667631.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i7.u0.s1>=1)&&(i6.u13.l234>=1))"))||(F(G(("((i7.u14.p17>=1)&&(i7.u0.l0>=1))")U(!("((i7.u0.s1>=1)&&(u7.l55>=1))")))))))
Formula 0 simplified : F!"((i7.u0.s1>=1)&&(i6.u13.l234>=1))" & GF(!"((i7.u14.p17>=1)&&(i7.u0.l0>=1))" R "((i7.u0.s1>=1)&&(u7.l55>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10344907441480627364
[2024-05-28 17:19:03] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10344907441480627364
Running compilation step : cd /tmp/ltsmin10344907441480627364;'/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 196 ms.
Running link step : cd /tmp/ltsmin10344907441480627364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10344907441480627364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-05 finished in 98372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((!p0 U (G(!p0)||(!p0&&G(!p1))))) U ((!p2&&X((!p0 U (G(!p0)||(!p0&&G(!p1))))))||X(G(!p0))))))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 7 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 17:19:18] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 17:19:18] [INFO ] Invariant cache hit.
[2024-05-28 17:19:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:19:18] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-28 17:19:18] [INFO ] Invariant cache hit.
[2024-05-28 17:19:18] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 61/70 places, 63/73 transitions.
Stuttering acceptance computed with spot in 324 ms :[p0, p0, p0, p0, p0, true, (AND p0 p1), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s25 1)), p1:(AND (GEQ s1 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s1 1) (GEQ s58 1) (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22471 reset in 98 ms.
Product exploration explored 100000 steps with 22370 reset in 194 ms.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 187 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[p0, p0, p0, p0, p0, true, (AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 387 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-28 17:19:20] [INFO ] Invariant cache hit.
[2024-05-28 17:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:19:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 17:19:20] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-28 17:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:19:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 17:19:20] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-28 17:19:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:19:20] [INFO ] After 21ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2024-05-28 17:19:20] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 17:19:20] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 164 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 59 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 60
Applied a total of 5 rules in 7 ms. Remains 59 /61 variables (removed 2) and now considering 60/63 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/61 places, 60/63 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 371 steps, run visited all 2 properties in 7 ms. (steps per millisecond=53 )
Probabilistic random walk after 371 steps, saw 214 distinct states, run finished after 8 ms. (steps per millisecond=46 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true, (G (NOT (AND p0 p2))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 309 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Support contains 3 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 17:19:21] [INFO ] Invariant cache hit.
[2024-05-28 17:19:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 17:19:21] [INFO ] Invariant cache hit.
[2024-05-28 17:19:21] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:19:21] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-28 17:19:21] [INFO ] Invariant cache hit.
[2024-05-28 17:19:21] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 61/61 places, 63/63 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 187 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 17:19:22] [INFO ] Invariant cache hit.
[2024-05-28 17:19:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 17:19:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 17:19:22] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 17:19:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 17:19:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 17:19:22] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 17:19:22] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:19:22] [INFO ] After 60ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 17:19:22] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-28 17:19:22] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 164 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 59 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 60
Applied a total of 5 rules in 9 ms. Remains 59 /61 variables (removed 2) and now considering 60/63 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/61 places, 60/63 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 371 steps, run visited all 2 properties in 6 ms. (steps per millisecond=61 )
Probabilistic random walk after 371 steps, saw 214 distinct states, run finished after 6 ms. (steps per millisecond=61 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 241 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 272 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 270 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Product exploration explored 100000 steps with 22272 reset in 166 ms.
Product exploration explored 100000 steps with 22509 reset in 194 ms.
Applying partial POR strategy [true, false, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 422 ms :[true, p0, p0, p1, p0, (AND p0 p1), p0, p0]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 62
Applied a total of 2 rules in 10 ms. Remains 60 /61 variables (removed 1) and now considering 62/63 (removed 1) transitions.
[2024-05-28 17:19:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:19:24] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 17:19:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/61 places, 62/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 60/61 places, 62/63 transitions.
Built C files in :
/tmp/ltsmin8590807524517618019
[2024-05-28 17:19:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8590807524517618019
Running compilation step : cd /tmp/ltsmin8590807524517618019;'/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 193 ms.
Running link step : cd /tmp/ltsmin8590807524517618019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8590807524517618019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased935431168033896188.hoa' '--buchi-type=spotba'
LTSmin run took 167 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 finished in 7262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 6 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:19:25] [INFO ] Computed 5 invariants in 8 ms
[2024-05-28 17:19:25] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 17:19:25] [INFO ] Invariant cache hit.
[2024-05-28 17:19:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:19:25] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-28 17:19:25] [INFO ] Invariant cache hit.
[2024-05-28 17:19:25] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s57 1) (LT s9 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 finished in 769 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(((p0 U !p1)&&X((X(G(p2)) U G(p3))))))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 5 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
[2024-05-28 17:19:26] [INFO ] Invariant cache hit.
[2024-05-28 17:19:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 17:19:26] [INFO ] Invariant cache hit.
[2024-05-28 17:19:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:19:26] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-28 17:19:26] [INFO ] Invariant cache hit.
[2024-05-28 17:19:26] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), true, p1, (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 2}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s19 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p3:(AND (GEQ s1 1) (GEQ s57 1)), p2:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 finished in 645 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' '!((p0 U X(X(G(p1)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 8 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 17:19:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:26] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 17:19:26] [INFO ] Invariant cache hit.
[2024-05-28 17:19:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:19:27] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-28 17:19:27] [INFO ] Invariant cache hit.
[2024-05-28 17:19:27] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/70 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 59/70 places, 61/73 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s20 1)), p0:(AND (GEQ s0 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-09 finished in 466 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&&F(p1)))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 2 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 17:19:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 17:19:27] [INFO ] Invariant cache hit.
[2024-05-28 17:19:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 17:19:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-28 17:19:27] [INFO ] Invariant cache hit.
[2024-05-28 17:19:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 65/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 62/70 places, 65/73 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s33 1)), p1:(OR (LT s1 1) (LT s39 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9298 steps with 2124 reset in 11 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 finished in 455 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&&X((!p0 U (!p1||G(!p0)))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 5 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 17:19:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 17:19:27] [INFO ] Invariant cache hit.
[2024-05-28 17:19:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:19:27] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 17:19:27] [INFO ] Invariant cache hit.
[2024-05-28 17:19:28] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/70 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 59/70 places, 61/73 transitions.
Stuttering acceptance computed with spot in 175 ms :[p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s29 1)), p1:(OR (AND (GEQ s1 1) (GEQ s29 1)) (AND (GEQ s1 1) (GEQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 finished in 1052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))||G(p1)))||F(!p2)))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 4 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 17:19:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:28] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 17:19:28] [INFO ] Invariant cache hit.
[2024-05-28 17:19:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 17:19:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-28 17:19:29] [INFO ] Invariant cache hit.
[2024-05-28 17:19:29] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 61/70 places, 63/73 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (LT s1 1) (LT s25 1)), p0:(AND (GEQ s1 1) (GEQ s43 1)), p1:(AND (GEQ s11 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-12 finished in 547 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(((p1||G(p2))&&p0)))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 2 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 17:19:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 17:19:29] [INFO ] Invariant cache hit.
[2024-05-28 17:19:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 17:19:29] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 17:19:29] [INFO ] Invariant cache hit.
[2024-05-28 17:19:29] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/70 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 59/70 places, 61/73 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(OR (LT s1 1) (LT s42 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p1:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 4 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 17:19:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 17:19:29] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 17:19:29] [INFO ] Invariant cache hit.
[2024-05-28 17:19:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 17:19:29] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-28 17:19:29] [INFO ] Invariant cache hit.
[2024-05-28 17:19:30] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 60/70 places, 62/73 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s42 1) (AND (GEQ s1 1) (GEQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 137 ms.
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 finished in 706 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)||F(G((p1 U !p2)))))'
[2024-05-28 17:19:30] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2024-05-28 17:19:30] [INFO ] Applying decomposition
[2024-05-28 17:19:30] [INFO ] Flatten gal took : 7 ms
Built C files in :
/tmp/ltsmin14560063143464873517
[2024-05-28 17:19:30] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2024-05-28 17:19:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:19:30] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2024-05-28 17:19:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:19:30] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2024-05-28 17:19:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:19:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14560063143464873517
Running compilation step : cd /tmp/ltsmin14560063143464873517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16959973243675875510.txt' '-o' '/tmp/graph16959973243675875510.bin' '-w' '/tmp/graph16959973243675875510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16959973243675875510.bin' '-l' '-1' '-v' '-w' '/tmp/graph16959973243675875510.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:19:30] [INFO ] Decomposing Gal with order
[2024-05-28 17:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:19:30] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-28 17:19:30] [INFO ] Flatten gal took : 15 ms
[2024-05-28 17:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 4 ms.
[2024-05-28 17:19:30] [INFO ] Time to serialize gal into /tmp/LTLFireability8571564403791278490.gal : 3 ms
[2024-05-28 17:19:30] [INFO ] Time to serialize properties into /tmp/LTLFireability14343312964935672533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8571564403791278490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14343312964935672533.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((i6.u0.s1>=1)&&(i5.u11.l234>=1))"))||(F(G(("((i6.u14.p17>=1)&&(i6.u0.l0>=1))")U(!("((i6.u0.s1>=1)&&(i3.u7.l55>=1))")))))))
Formula 0 simplified : F!"((i6.u0.s1>=1)&&(i5.u11.l234>=1))" & GF(!"((i6.u14.p17>=1)&&(i6.u0.l0>=1))" R "((i6.u0.s1>=1)&&(i3.u7.l55>=1))")
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin14560063143464873517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14560063143464873517;'/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' '--ltl' '([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: LTL layer: formula: ([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 76, guards 73
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: "([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.024: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.060: There are 77 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 71, there are 88 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Visible groups: 0 / 88, labels: 3 / 77
pins2lts-mc-linux64( 0/ 8), 0.060: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.090: [Blue] ~55 levels ~960 states ~2384 transitions
pins2lts-mc-linux64( 1/ 8), 0.117: [Blue] ~74 levels ~1920 states ~4816 transitions
pins2lts-mc-linux64( 1/ 8), 0.158: [Blue] ~109 levels ~3840 states ~9496 transitions
pins2lts-mc-linux64( 1/ 8), 0.216: [Blue] ~244 levels ~7680 states ~19904 transitions
pins2lts-mc-linux64( 1/ 8), 0.355: [Blue] ~465 levels ~15360 states ~39288 transitions
pins2lts-mc-linux64( 0/ 8), 0.706: [Blue] ~1046 levels ~30720 states ~71472 transitions
pins2lts-mc-linux64( 0/ 8), 1.207: [Blue] ~1907 levels ~61440 states ~141696 transitions
pins2lts-mc-linux64( 2/ 8), 2.314: [Blue] ~2544 levels ~122880 states ~312400 transitions
pins2lts-mc-linux64( 2/ 8), 3.340: [Blue] ~2850 levels ~245760 states ~589848 transitions
pins2lts-mc-linux64( 2/ 8), 5.381: [Blue] ~4554 levels ~491520 states ~1212192 transitions
pins2lts-mc-linux64( 7/ 8), 8.163: [Blue] ~2335 levels ~983040 states ~2107272 transitions
pins2lts-mc-linux64( 7/ 8), 12.723: [Blue] ~2335 levels ~1966080 states ~4201088 transitions
pins2lts-mc-linux64( 7/ 8), 22.022: [Blue] ~2335 levels ~3932160 states ~8542360 transitions
pins2lts-mc-linux64( 7/ 8), 41.781: [Blue] ~2335 levels ~7864320 states ~17851184 transitions
pins2lts-mc-linux64( 7/ 8), 81.307: [Blue] ~2335 levels ~15728640 states ~36120600 transitions
pins2lts-mc-linux64( 7/ 8), 162.795: [Blue] ~41654 levels ~31457280 states ~74865776 transitions
pins2lts-mc-linux64( 7/ 8), 324.758: [Blue] ~148510 levels ~62914560 states ~152389344 transitions
pins2lts-mc-linux64( 4/ 8), 399.822: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 399.908:
pins2lts-mc-linux64( 0/ 8), 399.908: Explored 70123238 states 184896530 transitions, fanout: 2.637
pins2lts-mc-linux64( 0/ 8), 399.908: Total exploration time 399.820 sec (399.750 sec minimum, 399.781 sec on average)
pins2lts-mc-linux64( 0/ 8), 399.908: States per second: 175387, Transitions per second: 462449
pins2lts-mc-linux64( 0/ 8), 399.908:
pins2lts-mc-linux64( 0/ 8), 399.908: State space has 70781444 states, 52231 are accepting
pins2lts-mc-linux64( 0/ 8), 399.908: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 399.908: blue states: 70123238 (99.07%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 399.908: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 399.908: all-red states: 93764 (0.13%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 399.908:
pins2lts-mc-linux64( 0/ 8), 399.908: Total memory used for local state coloring: 68.9MB
pins2lts-mc-linux64( 0/ 8), 399.908:
pins2lts-mc-linux64( 0/ 8), 399.908: Queue width: 8B, total height: 4517660, memory: 34.47MB
pins2lts-mc-linux64( 0/ 8), 399.908: Tree memory: 796.0MB, 11.8 B/state, compr.: 4.1%
pins2lts-mc-linux64( 0/ 8), 399.908: Tree fill ratio (roots/leafs): 52.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 399.908: Stored 73 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 399.908: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 399.908: Est. total memory use: 830.5MB (~1058.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14560063143464873517;'/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' '--ltl' '([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14560063143464873517;'/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' '--ltl' '([]((LTLAPp0==true))||<>([](((LTLAPp1==true) U !(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 17:40:13] [INFO ] Flatten gal took : 9 ms
[2024-05-28 17:40:13] [INFO ] Time to serialize gal into /tmp/LTLFireability10342215439014048680.gal : 10 ms
[2024-05-28 17:40:13] [INFO ] Time to serialize properties into /tmp/LTLFireability5518543401863705375.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10342215439014048680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5518543401863705375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G("((s1>=1)&&(l234>=1))"))||(F(G(("((p17>=1)&&(l0>=1))")U(!("((s1>=1)&&(l55>=1))")))))))
Formula 0 simplified : F!"((s1>=1)&&(l234>=1))" & GF(!"((p17>=1)&&(l0>=1))" R "((s1>=1)&&(l55>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t8, t10, t20, t26, t36, t47, t51, t52, t53, t54, t55, t56, t57, t58, t60, t61, t6...296
Computing Next relation with stutter on 1.47413e+13 deadlock states
Detected timeout of ITS tools.
[2024-05-28 18:00:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 18:00:55] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-28 18:00:55] [INFO ] Transformed 70 places.
[2024-05-28 18:00:55] [INFO ] Transformed 73 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 18:00:55] [INFO ] Time to serialize gal into /tmp/LTLFireability13057299716573461013.gal : 6 ms
[2024-05-28 18:00:55] [INFO ] Time to serialize properties into /tmp/LTLFireability8539104891850308274.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13057299716573461013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8539104891850308274.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((s1>=1)&&(l234>=1))"))||(F(G(("((p17>=1)&&(l0>=1))")U(!("((s1>=1)&&(l55>=1))")))))))
Formula 0 simplified : F!"((s1>=1)&&(l234>=1))" & GF(!"((p17>=1)&&(l0>=1))" R "((s1>=1)&&(l55>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11445660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039992 kB

BK_TIME_CONFINEMENT_REACHED

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

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