Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282800860.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282800860
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Jun 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 57K Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654944929736

Running Version 202205111006
[2022-06-11 10:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 10:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 10:55:31] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-11 10:55:31] [INFO ] Transformed 262 places.
[2022-06-11 10:55:31] [INFO ] Transformed 73 transitions.
[2022-06-11 10:55:31] [INFO ] Parsed PT model containing 262 places and 73 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 64 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 64 transition count 67
Applied a total of 14 rules in 27 ms. Remains 64 /72 variables (removed 8) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 64 cols
[2022-06-11 10:55:31] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 10:55:31] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 67 rows 64 cols
[2022-06-11 10:55:31] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 10:55:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-11 10:55:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 64 cols
[2022-06-11 10:55:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:55:31] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/72 places, 67/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/72 places, 67/73 transitions.
Support contains 31 out of 64 places after structural reductions.
[2022-06-11 10:55:31] [INFO ] Flatten gal took : 31 ms
[2022-06-11 10:55:31] [INFO ] Flatten gal took : 12 ms
[2022-06-11 10:55:31] [INFO ] Input system was already deterministic with 67 transitions.
Support contains 27 out of 64 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 117 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 67 rows 64 cols
[2022-06-11 10:55:32] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 10:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:55:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:55:33] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2022-06-11 10:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:55:33] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:55:33] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2022-06-11 10:55:33] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-11 10:55:33] [INFO ] After 125ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :1 sat :16
[2022-06-11 10:55:33] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-06-11 10:55:33] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 18 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 67/67 transitions.
Applied a total of 0 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 67/67 transitions.
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Finished probabilistic random walk after 1702 steps, run visited all 16 properties in 23 ms. (steps per millisecond=74 )
Probabilistic random walk after 1702 steps, saw 877 distinct states, run finished after 24 ms. (steps per millisecond=70 ) properties seen :16
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 8 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(X(p0)))&&F(!(X(p1) U F(p1)))))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Applied a total of 6 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:55:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:34] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:55:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:55:34] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:55:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 64/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/64 places, 64/67 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s33 1)), p1:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3359 steps with 762 reset in 36 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-00 finished in 698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1) U p0)||G((X(p3)||p2))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 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 7 place count 61 transition count 63
Applied a total of 7 rules in 9 ms. Remains 61 /64 variables (removed 3) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:55:35] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:35] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 63/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/64 places, 63/67 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=(AND p2 p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1 p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p2:(OR (LT s2 1) (LT s47 1)), p0:(AND (GEQ s1 1) (GEQ s50 1)), p1:(AND (GEQ s1 1) (GEQ s43 1)), p3:(AND (GEQ s16 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22371 reset in 211 ms.
Product exploration explored 100000 steps with 22394 reset in 141 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1) (NOT p3)), (X p2), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p0) p1 p3))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1) p3))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p3)))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 1206 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3072350 steps, run timeout after 3001 ms. (steps per millisecond=1023 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 3072350 steps, saw 1259461 distinct states, run finished after 3001 ms. (steps per millisecond=1023 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:55:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:55:40] [INFO ] After 25ms 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 p2 (NOT p0) (NOT p1) (NOT p3)), (X p2), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p0) p1 p3))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1) p3))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p3)))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) p3)))), (G (NOT (AND (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT p2)), (F p3), (F (AND p2 p3))]
Knowledge based reduction with 33 factoid took 1304 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Support contains 4 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 2 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:55:42] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:55:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 10:55:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:42] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 63/63 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p3) p2), (X p2), (X (X p2)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1039 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1119 steps, run visited all 2 properties in 6 ms. (steps per millisecond=186 )
Probabilistic random walk after 1119 steps, saw 532 distinct states, run finished after 7 ms. (steps per millisecond=159 ) properties seen :2
Knowledge obtained : [(AND (NOT p3) p2), (X p2), (X (X p2)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 22389 reset in 89 ms.
Product exploration explored 100000 steps with 22333 reset in 124 ms.
Built C files in :
/tmp/ltsmin1045797104840757309
[2022-06-11 10:55:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1045797104840757309
Running compilation step : cd /tmp/ltsmin1045797104840757309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin1045797104840757309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1045797104840757309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15656858461787175419.hoa' '--buchi-type=spotba'
LTSmin run took 188 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-01 finished in 9437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 11 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:55:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:44] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:55:44] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-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 s44 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-d0m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-04 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(!(G(p2) U X(p2))&&p1))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 7 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:45] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:55:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:55:45] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s20 1)), p1:(AND (GEQ s1 1) (GEQ s45 1)), p2:(AND (GEQ s1 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-05 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p1)||p0))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 9 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:45] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:55:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:55:45] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-06-11 10:55:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s38 1) (AND (GEQ s12 1) (GEQ s46 1) (GEQ s1 1) (GEQ s58 1))), p1:(AND (GEQ s12 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22218 reset in 107 ms.
Product exploration explored 100000 steps with 22348 reset in 126 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 4 ms. (steps per millisecond=72 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 4 ms. (steps per millisecond=72 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:55:46] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:55:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:55:46] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-06-11 10:55:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:55:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:55:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 6 ms. (steps per millisecond=48 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 6 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22353 reset in 93 ms.
Product exploration explored 100000 steps with 22321 reset in 91 ms.
Built C files in :
/tmp/ltsmin17548703938379551255
[2022-06-11 10:55:47] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:55:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:55:47] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:55:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:55:47] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:55:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:55:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17548703938379551255
Running compilation step : cd /tmp/ltsmin17548703938379551255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin17548703938379551255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17548703938379551255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16312290430346408879.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:02] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:02] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-06-11 10:56:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin15850388247580538218
[2022-06-11 10:56:02] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:56:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:02] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:56:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:02] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:56:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15850388247580538218
Running compilation step : cd /tmp/ltsmin15850388247580538218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin15850388247580538218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15850388247580538218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11851413057360910792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 10:56:17] [INFO ] Flatten gal took : 10 ms
[2022-06-11 10:56:17] [INFO ] Flatten gal took : 5 ms
[2022-06-11 10:56:17] [INFO ] Time to serialize gal into /tmp/LTL8338901355456210787.gal : 2 ms
[2022-06-11 10:56:17] [INFO ] Time to serialize properties into /tmp/LTL17899296937134286724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8338901355456210787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17899296937134286724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8338901...267
Read 1 LTL properties
Checking formula 0 : !((G(F(((F("((p15>=1)&&(l128>=1))"))||("(s1<1)"))||("((l86<1)||(((p15>=1)&&(l128>=1))&&((s1>=1)&&(l236>=1))))")))))
Formula 0 simplified : !GF("((l86<1)||(((p15>=1)&&(l128>=1))&&((s1>=1)&&(l236>=1))))" | "(s1<1)" | F"((p15>=1)&&(l128>=1))")
Reverse transition relation is NOT exact ! Due to transitions t44, t48, t49, t50, t51, t52, t53, t55, t57, t58, t59, t60, t61, t63, t66, Intersection with...235
Computing Next relation with stutter on 2.88378e+07 deadlock states
51 unique states visited
0 strongly connected components in search stack
92 transitions explored
47 items max in DFS search stack
541 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.44528,113080,1,0,285,430162,160,239,2094,326243,718
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-07 finished in 38331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 14 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:23] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-11 10:56:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-10 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(G(F((G(p1)&&p2))))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 6 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:23] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1)), p2:(OR (LT s5 1) (LT s27 1)), p1:(AND (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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-11 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((!(X(p1) U F(p1))||p0))))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 11 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:56:24] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-11 10:56:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:24] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s48 1)), p0:(OR (LT s5 1) (LT s27 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22351 reset in 103 ms.
Product exploration explored 100000 steps with 22350 reset in 128 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 526 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2934708 steps, run timeout after 3001 ms. (steps per millisecond=977 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 2934708 steps, saw 1231507 distinct states, run finished after 3001 ms. (steps per millisecond=977 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:56:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:56:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:56:28] [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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 391 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:56:29] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-11 10:56:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 281 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1054 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3003045 steps, run timeout after 3001 ms. (steps per millisecond=1000 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 3003045 steps, saw 1260328 distinct states, run finished after 3001 ms. (steps per millisecond=1000 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:56:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:56:32] [INFO ] After 30ms 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 385 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22303 reset in 108 ms.
Product exploration explored 100000 steps with 22262 reset in 104 ms.
Built C files in :
/tmp/ltsmin9434280267057374964
[2022-06-11 10:56:33] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:56:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:33] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:56:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:33] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:56:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9434280267057374964
Running compilation step : cd /tmp/ltsmin9434280267057374964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin9434280267057374964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9434280267057374964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15830080776594232980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:56:48] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:48] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:56:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:56:48] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-06-11 10:56:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:56:48] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:56:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin12048187008304457916
[2022-06-11 10:56:48] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:56:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:48] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:56:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:48] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:56:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:56:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12048187008304457916
Running compilation step : cd /tmp/ltsmin12048187008304457916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin12048187008304457916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12048187008304457916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4028238273321984227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 10:57:04] [INFO ] Flatten gal took : 5 ms
[2022-06-11 10:57:04] [INFO ] Flatten gal took : 4 ms
[2022-06-11 10:57:04] [INFO ] Time to serialize gal into /tmp/LTL8601236960860693701.gal : 1 ms
[2022-06-11 10:57:04] [INFO ] Time to serialize properties into /tmp/LTL14803294609033059149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8601236960860693701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14803294609033059149.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8601236...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((!((X("((s1>=1)&&(l202>=1))"))U(F("((s1>=1)&&(l202>=1))"))))||("(s5<1)"))||("(l33<1)")))))))
Formula 0 simplified : !FGFG("(l33<1)" | "(s5<1)" | !(X"((s1>=1)&&(l202>=1))" U F"((s1>=1)&&(l202>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t44, t48, t49, t50, t51, t52, t53, t55, t57, t58, t59, t60, t61, t63, t66, Intersection with...235
Computing Next relation with stutter on 2.88378e+07 deadlock states
Detected timeout of ITS tools.
[2022-06-11 10:57:19] [INFO ] Flatten gal took : 10 ms
[2022-06-11 10:57:19] [INFO ] Applying decomposition
[2022-06-11 10:57:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15358878786155652409.txt' '-o' '/tmp/graph15358878786155652409.bin' '-w' '/tmp/graph15358878786155652409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15358878786155652409.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358878786155652409.weights' '-q' '0' '-e' '0.001'
[2022-06-11 10:57:19] [INFO ] Decomposing Gal with order
[2022-06-11 10:57:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 10:57:19] [INFO ] Removed a total of 57 redundant transitions.
[2022-06-11 10:57:19] [INFO ] Flatten gal took : 35 ms
[2022-06-11 10:57:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2022-06-11 10:57:19] [INFO ] Time to serialize gal into /tmp/LTL6889855751960430792.gal : 2 ms
[2022-06-11 10:57:19] [INFO ] Time to serialize properties into /tmp/LTL15986976121942746337.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6889855751960430792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15986976121942746337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6889855...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((!((X("((i0.u0.s1>=1)&&(i5.u12.l202>=1))"))U(F("((i0.u0.s1>=1)&&(i5.u12.l202>=1))"))))||("(i1.u4.s5<1)"))||("(i3.u9.l33<1)...163
Formula 0 simplified : !FGFG("(i1.u4.s5<1)" | "(i3.u9.l33<1)" | !(X"((i0.u0.s1>=1)&&(i5.u12.l202>=1))" U F"((i0.u0.s1>=1)&&(i5.u12.l202>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12928246381627317469
[2022-06-11 10:57:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12928246381627317469
Running compilation step : cd /tmp/ltsmin12928246381627317469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin12928246381627317469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12928246381627317469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-12 finished in 85124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 19 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:57:49] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:57:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:57:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-11 10:57:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:57:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22322 reset in 174 ms.
Product exploration explored 100000 steps with 22425 reset in 216 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 7779 steps, including 372 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1555 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:57:50] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:57:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:57:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-06-11 10:57:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:57:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:57:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 168 steps, including 36 resets, run visited all 1 properties in 1 ms. (steps per millisecond=168 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22385 reset in 94 ms.
Product exploration explored 100000 steps with 22320 reset in 83 ms.
Built C files in :
/tmp/ltsmin10183447031406099869
[2022-06-11 10:57:51] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:57:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:57:51] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:57:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:57:51] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:57:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:57:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10183447031406099869
Running compilation step : cd /tmp/ltsmin10183447031406099869;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin10183447031406099869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10183447031406099869;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12821328828416112922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:58:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:58:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:58:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:58:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:58:06] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-11 10:58:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:58:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:06] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin16525883108438735189
[2022-06-11 10:58:06] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 10:58:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:06] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 10:58:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:06] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 10:58:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16525883108438735189
Running compilation step : cd /tmp/ltsmin16525883108438735189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin16525883108438735189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16525883108438735189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16998966360897424533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 10:58:21] [INFO ] Flatten gal took : 6 ms
[2022-06-11 10:58:21] [INFO ] Flatten gal took : 4 ms
[2022-06-11 10:58:21] [INFO ] Time to serialize gal into /tmp/LTL4434990693800049927.gal : 2 ms
[2022-06-11 10:58:21] [INFO ] Time to serialize properties into /tmp/LTL14571136177845694733.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4434990693800049927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14571136177845694733.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4434990...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((s1<1)||(l126<1))"))))))
Formula 0 simplified : !XFGF"((s1<1)||(l126<1))"
Reverse transition relation is NOT exact ! Due to transitions t44, t48, t49, t50, t51, t52, t53, t55, t57, t58, t59, t60, t61, t63, t66, Intersection with...235
Computing Next relation with stutter on 2.88378e+07 deadlock states
58 unique states visited
0 strongly connected components in search stack
92 transitions explored
47 items max in DFS search stack
530 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.32792,112376,1,0,329,428952,152,268,2075,325648,842
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-13 finished in 38089 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!F((G(p0)&&F(p1)))) U (G(p3)&&p2)))'
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Applied a total of 6 rules in 9 ms. Remains 61 /64 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:58:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:58:27] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:58:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:58:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-06-11 10:58:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 10:58:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:27] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/64 places, 64/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/64 places, 64/67 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p2) (NOT p3)), (AND p1 p0), (AND p1 p0), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s58 1)), p3:(AND (GEQ s7 1) (GEQ s19 1)), p1:(AND (GEQ s1 1) (GEQ s40 1)), p0:(AND (GEQ s1 1) (GEQ s29 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 68 steps with 12 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-14 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!F(p1))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 8 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:27] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:58:28] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-06-11 10:58:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:58:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s38 1)), p0:(OR (NOT (AND (GEQ s1 1) (GEQ s57 1))) (NOT (AND (GEQ s1 1) (GEQ s41 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22339 reset in 117 ms.
Product exploration explored 100000 steps with 22498 reset in 120 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 422 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, true, p1]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2917427 steps, run timeout after 3001 ms. (steps per millisecond=972 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 2917427 steps, saw 1221710 distinct states, run finished after 3001 ms. (steps per millisecond=972 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:58:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:58:32] [INFO ] After 39ms 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 558 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[p1, true, p1]
Stuttering acceptance computed with spot in 76 ms :[p1, true, p1]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:58:33] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:58:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:58:33] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:58:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[p1, true, p1]
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Finished probabilistic random walk after 759 steps, run visited all 3 properties in 6 ms. (steps per millisecond=126 )
Probabilistic random walk after 759 steps, saw 408 distinct states, run finished after 6 ms. (steps per millisecond=126 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, true, p1]
Stuttering acceptance computed with spot in 72 ms :[p1, true, p1]
Stuttering acceptance computed with spot in 93 ms :[p1, true, p1]
Product exploration explored 100000 steps with 22384 reset in 105 ms.
Product exploration explored 100000 steps with 22342 reset in 110 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 67 ms :[p1, true, p1]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2022-06-11 10:58:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:58:35] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 10:58:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Product exploration explored 100000 steps with 22349 reset in 190 ms.
Product exploration explored 100000 steps with 22474 reset in 234 ms.
Built C files in :
/tmp/ltsmin14615453370470389043
[2022-06-11 10:58:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14615453370470389043
Running compilation step : cd /tmp/ltsmin14615453370470389043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin14615453370470389043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14615453370470389043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14311439574324353368.hoa' '--buchi-type=spotba'
LTSmin run took 356 ms.
FORMULA SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m18-LTLFireability-15 finished in 8202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((!(X(p1) U F(p1))||p0))))))'
[2022-06-11 10:58:36] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8306891489938737939
[2022-06-11 10:58:36] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2022-06-11 10:58:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:36] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2022-06-11 10:58:36] [INFO ] Applying decomposition
[2022-06-11 10:58:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:36] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2022-06-11 10:58:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 10:58:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8306891489938737939
Running compilation step : cd /tmp/ltsmin8306891489938737939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 10:58:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2651839863061703349.txt' '-o' '/tmp/graph2651839863061703349.bin' '-w' '/tmp/graph2651839863061703349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2651839863061703349.bin' '-l' '-1' '-v' '-w' '/tmp/graph2651839863061703349.weights' '-q' '0' '-e' '0.001'
[2022-06-11 10:58:36] [INFO ] Decomposing Gal with order
[2022-06-11 10:58:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 10:58:36] [INFO ] Removed a total of 60 redundant transitions.
[2022-06-11 10:58:36] [INFO ] Flatten gal took : 28 ms
[2022-06-11 10:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2022-06-11 10:58:36] [INFO ] Time to serialize gal into /tmp/LTLFireability8912956355934506231.gal : 9 ms
[2022-06-11 10:58:36] [INFO ] Time to serialize properties into /tmp/LTLFireability10628783327342810471.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8912956355934506231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10628783327342810471.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((!((X("((i5.u0.s1>=1)&&(i4.u10.l202>=1))"))U(F("((i5.u0.s1>=1)&&(i4.u10.l202>=1))"))))||("(i1.u3.s5<1)"))||("(i2.u7.l33<1)...163
Formula 0 simplified : !FGFG("(i1.u3.s5<1)" | "(i2.u7.l33<1)" | !(X"((i5.u0.s1>=1)&&(i4.u10.l202>=1))" U F"((i5.u0.s1>=1)&&(i4.u10.l202>=1))"))
Compilation finished in 154 ms.
Running link step : cd /tmp/ltsmin8306891489938737939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8306891489938737939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: <>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))
pins2lts-mc-linux64( 1/ 8), 0.003: "<>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 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.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: There are 70 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.027: State length is 65, there are 75 groups
pins2lts-mc-linux64( 0/ 8), 0.027: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.027: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.035: [Blue] ~47 levels ~960 states ~2024 transitions
pins2lts-mc-linux64( 4/ 8), 0.053: [Blue] ~89 levels ~1920 states ~5176 transitions
pins2lts-mc-linux64( 4/ 8), 0.068: [Blue] ~149 levels ~3840 states ~9872 transitions
pins2lts-mc-linux64( 5/ 8), 0.108: [Blue] ~216 levels ~7680 states ~19176 transitions
pins2lts-mc-linux64( 5/ 8), 0.171: [Blue] ~289 levels ~15360 states ~35280 transitions
pins2lts-mc-linux64( 5/ 8), 0.274: [Blue] ~376 levels ~30720 states ~67688 transitions
pins2lts-mc-linux64( 0/ 8), 0.480: [Blue] ~883 levels ~61440 states ~146936 transitions
pins2lts-mc-linux64( 1/ 8), 0.774: [Blue] ~997 levels ~122880 states ~290168 transitions
pins2lts-mc-linux64( 1/ 8), 1.257: [Blue] ~1520 levels ~245760 states ~594000 transitions
pins2lts-mc-linux64( 1/ 8), 1.933: [Blue] ~2979 levels ~491520 states ~1220424 transitions
pins2lts-mc-linux64( 1/ 8), 2.815: [Blue] ~6507 levels ~983040 states ~2516920 transitions
pins2lts-mc-linux64( 1/ 8), 4.152: [Blue] ~14214 levels ~1966080 states ~5256248 transitions
pins2lts-mc-linux64( 3/ 8), 6.477: [Blue] ~24177 levels ~3932160 states ~10782264 transitions
pins2lts-mc-linux64( 6/ 8), 11.782: [Blue] ~27479 levels ~7864320 states ~20547392 transitions
pins2lts-mc-linux64( 6/ 8), 21.173: [Blue] ~27479 levels ~15728640 states ~41182912 transitions
pins2lts-mc-linux64( 6/ 8), 40.665: [Blue] ~27479 levels ~31457280 states ~83107800 transitions
pins2lts-mc-linux64( 6/ 8), 80.380: [Blue] ~27479 levels ~62914560 states ~166524904 transitions
pins2lts-mc-linux64( 6/ 8), 161.182: [Blue] ~27479 levels ~125829120 states ~325738688 transitions
pins2lts-mc-linux64( 2/ 8), 217.792: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 217.873:
pins2lts-mc-linux64( 0/ 8), 217.873: Explored 143181929 states 428727043 transitions, fanout: 2.994
pins2lts-mc-linux64( 0/ 8), 217.873: Total exploration time 217.840 sec (217.760 sec minimum, 217.789 sec on average)
pins2lts-mc-linux64( 0/ 8), 217.873: States per second: 657280, Transitions per second: 1968082
pins2lts-mc-linux64( 0/ 8), 217.873:
pins2lts-mc-linux64( 0/ 8), 217.873: State space has 134217284 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 217.873: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 217.873: blue states: 143181929 (106.68%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 217.873: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 217.873: all-red states: 3402619 (2.54%), bogus 8298 (0.01%)
pins2lts-mc-linux64( 0/ 8), 217.873:
pins2lts-mc-linux64( 0/ 8), 217.873: Total memory used for local state coloring: 4.2MB
pins2lts-mc-linux64( 0/ 8), 217.873:
pins2lts-mc-linux64( 0/ 8), 217.873: Queue width: 8B, total height: 278207, memory: 2.12MB
pins2lts-mc-linux64( 0/ 8), 217.873: Tree memory: 1028.8MB, 8.0 B/state, compr.: 3.1%
pins2lts-mc-linux64( 0/ 8), 217.873: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 217.873: Stored 67 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 217.873: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 217.873: Est. total memory use: 1030.9MB (~1026.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8306891489938737939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8306891489938737939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([]((!(X((LTLAPp1==true)) U <>((LTLAPp1==true)))||(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 11:19:37] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:19:37] [INFO ] Time to serialize gal into /tmp/LTLFireability9627293252976338596.gal : 1 ms
[2022-06-11 11:19:37] [INFO ] Time to serialize properties into /tmp/LTLFireability13585702464593594711.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9627293252976338596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13585702464593594711.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((!((X("((s1>=1)&&(l202>=1))"))U(F("((s1>=1)&&(l202>=1))"))))||("(s5<1)"))||("(l33<1)")))))))
Formula 0 simplified : !FGFG("(l33<1)" | "(s5<1)" | !(X"((s1>=1)&&(l202>=1))" U F"((s1>=1)&&(l202>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t23, t33, t44, t48, t49, t50, t51, t52, t53, t54, t55, t57, t58, t59, t60, t61, t63, ...263
Computing Next relation with stutter on 8.7437e+07 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:40:38] [INFO ] Flatten gal took : 5 ms
[2022-06-11 11:40:38] [INFO ] Input system was already deterministic with 67 transitions.
[2022-06-11 11:40:38] [INFO ] Transformed 64 places.
[2022-06-11 11:40:38] [INFO ] Transformed 67 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-11 11:40:38] [INFO ] Time to serialize gal into /tmp/LTLFireability1591336292561119373.gal : 1 ms
[2022-06-11 11:40:38] [INFO ] Time to serialize properties into /tmp/LTLFireability16177244478837897476.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1591336292561119373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16177244478837897476.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(F(G(((!((X("((s1>=1)&&(l202>=1))"))U(F("((s1>=1)&&(l202>=1))"))))||("(s5<1)"))||("(l33<1)")))))))
Formula 0 simplified : !FGFG("(l33<1)" | "(s5<1)" | !(X"((s1>=1)&&(l202>=1))" U F"((s1>=1)&&(l202>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t23, t33, t44, t48, t49, t50, t51, t52, t53, t54, t55, t57, t58, t59, t60, t61, t63, ...263
Computing Next relation with stutter on 8.7437e+07 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d0m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282800860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;