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-165472282900876.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-d0m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900876
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 10K Jun 7 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 7 17:03 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-d0m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654947728700

Running Version 202205111006
[2022-06-11 11:42:09] [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 11:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 11:42:10] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-06-11 11:42:10] [INFO ] Transformed 262 places.
[2022-06-11 11:42:10] [INFO ] Transformed 73 transitions.
[2022-06-11 11:42:10] [INFO ] Parsed PT model containing 262 places and 73 transitions in 190 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 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 67 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 67 transition count 70
Applied a total of 8 rules in 15 ms. Remains 67 /72 variables (removed 5) and now considering 70/73 (removed 3) transitions.
// Phase 1: matrix 70 rows 67 cols
[2022-06-11 11:42:10] [INFO ] Computed 5 place invariants in 11 ms
[2022-06-11 11:42:10] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 70 rows 67 cols
[2022-06-11 11:42:10] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 11:42:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 11:42:10] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
// Phase 1: matrix 70 rows 67 cols
[2022-06-11 11:42:10] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 11:42:10] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 70/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/72 places, 70/73 transitions.
Support contains 24 out of 67 places after structural reductions.
[2022-06-11 11:42:10] [INFO ] Flatten gal took : 24 ms
[2022-06-11 11:42:10] [INFO ] Flatten gal took : 10 ms
[2022-06-11 11:42:10] [INFO ] Input system was already deterministic with 70 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 70 rows 67 cols
[2022-06-11 11:42:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:42:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:42:12] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:42:12] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2022-06-11 11:42:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 11:42:12] [INFO ] After 12ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 11:42:12] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 11:42:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:42:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2022-06-11 11:42:12] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-11 11:42:12] [INFO ] After 95ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-11 11:42:12] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-06-11 11:42:12] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 212 ms.
Support contains 13 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 67
Applied a total of 6 rules in 10 ms. Remains 64 /67 variables (removed 3) and now considering 67/70 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 67/70 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1029 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1006 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Finished probabilistic random walk after 1406 steps, run visited all 11 properties in 43 ms. (steps per millisecond=32 )
Probabilistic random walk after 1406 steps, saw 711 distinct states, run finished after 45 ms. (steps per millisecond=31 ) properties seen :11
Computed a total of 9 stabilizing places and 9 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 9 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:14] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 11:42:14] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s12 1) (LT s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Product exploration explored 100000 steps with 33333 reset in 132 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-00 finished in 854 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1))||X(G(X(p2))))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 60 transition count 62
Applied a total of 15 rules in 11 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:15] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:42:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:42:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p2:(AND (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(((p0 U G(p1)) U p0))||G(p1)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 12 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 11:42:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s18 1)), p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 12 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:42:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 finished in 299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 61 transition count 63
Applied a total of 13 rules in 7 ms. Remains 61 /67 variables (removed 6) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 11:42:16] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 63/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 63/70 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s23 1) (AND (GEQ s1 1) (GEQ s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 finished in 604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G(F((F(p0)&&p1))) U X(p2)))))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 60 transition count 62
Applied a total of 15 rules in 14 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:42:17] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:42:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-06-11 11:42:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s18 1)), p0:(AND (GEQ s1 1) (GEQ s49 1)), p1:(OR (AND (GEQ s1 1) (GEQ s37 1)) (AND (GEQ s1 1) (GEQ s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 finished in 476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(p1 U p2)||!(X(G(p3)) U G(p3))||p0))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 66
Applied a total of 8 rules in 12 ms. Remains 63 /67 variables (removed 4) and now considering 66/70 (removed 4) transitions.
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:17] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:17] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 11:42:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-06-11 11:42:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:42:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 66/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 66/70 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND p3 (NOT p1) (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s48 1)), p3:(AND (GEQ s1 1) (GEQ s40 1)), p1:(AND (GEQ s14 1) (GEQ s20 1)), p2:(AND (GEQ s1 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22249 reset in 107 ms.
Product exploration explored 100000 steps with 22479 reset in 103 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 p3) (NOT p1) (NOT p2)), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (OR (AND p0 p3) (AND p3 (NOT p1) (NOT p2))))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 p3) (AND p3 (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 502 ms. Reduced automaton from 3 states, 9 edges and 4 AP to 3 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3)]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 350087 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{3=1, 5=1}
Probabilistic random walk after 350087 steps, saw 180243 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:42:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:42:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 11:42:22] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2022-06-11 11:42:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:42:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 11:42:22] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (OR (AND p0 p3) (AND p3 (NOT p1) (NOT p2))))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 p3) (AND p3 (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p0) (NOT p2) p3 p1))), (G (NOT (AND (NOT p2) p3 p1))), (G (NOT (AND (NOT p0) p2 p3)))]
False Knowledge obtained : [(F (AND (NOT p2) p3 (NOT p1))), (F (OR (AND p0 p3) (AND (NOT p2) p3 (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 p3)))
Knowledge based reduction with 17 factoid took 448 ms. Reduced automaton from 3 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-09 finished in 5473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(p0))||F(p0)))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 12 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:23] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:23] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-11 11:42:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 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 s40 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 22477 reset in 90 ms.
Product exploration explored 100000 steps with 22442 reset in 132 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 101 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 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 144 steps, including 29 resets, run visited all 1 properties in 1 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 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 11:42:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:24] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-11 11:42:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:24] [INFO ] Dead Transitions using invariants and state equation in 49 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 111 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22350 reset in 112 ms.
Product exploration explored 100000 steps with 22484 reset in 120 ms.
Built C files in :
/tmp/ltsmin14812754246386078459
[2022-06-11 11:42:25] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:42:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:25] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:42:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:25] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:42:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14812754246386078459
Running compilation step : cd /tmp/ltsmin14812754246386078459;'/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 249 ms.
Running link step : cd /tmp/ltsmin14812754246386078459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14812754246386078459;'/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/stateBased15675672825426581359.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 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 11:42:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:42:40] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:42:40] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-06-11 11:42:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:42:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:42:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin14145233916966926067
[2022-06-11 11:42:40] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:42:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:40] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:42:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:40] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:42:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:42:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14145233916966926067
Running compilation step : cd /tmp/ltsmin14145233916966926067;'/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/ltsmin14145233916966926067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14145233916966926067;'/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/stateBased8008615870094007881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:42:55] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:42:55] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:42:55] [INFO ] Time to serialize gal into /tmp/LTL6687210152621156303.gal : 2 ms
[2022-06-11 11:42:55] [INFO ] Time to serialize properties into /tmp/LTL16654528916813583837.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/LTL6687210152621156303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16654528916813583837.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/LTL6687210...267
Read 1 LTL properties
Checking formula 0 : !((G(X((G(F("((s1<1)||(l90<1))")))||(F("((s1<1)||(l90<1))"))))))
Formula 0 simplified : !GX(F"((s1<1)||(l90<1))" | GF"((s1<1)||(l90<1))")
Detected timeout of ITS tools.
[2022-06-11 11:43:10] [INFO ] Flatten gal took : 9 ms
[2022-06-11 11:43:10] [INFO ] Applying decomposition
[2022-06-11 11:43:10] [INFO ] Flatten gal took : 17 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/graph4340174318398265922.txt' '-o' '/tmp/graph4340174318398265922.bin' '-w' '/tmp/graph4340174318398265922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4340174318398265922.bin' '-l' '-1' '-v' '-w' '/tmp/graph4340174318398265922.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:43:10] [INFO ] Decomposing Gal with order
[2022-06-11 11:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:43:10] [INFO ] Removed a total of 55 redundant transitions.
[2022-06-11 11:43:10] [INFO ] Flatten gal took : 52 ms
[2022-06-11 11:43:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 8 ms.
[2022-06-11 11:43:10] [INFO ] Time to serialize gal into /tmp/LTL11917957976725805430.gal : 5 ms
[2022-06-11 11:43:10] [INFO ] Time to serialize properties into /tmp/LTL15189458367667507357.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/LTL11917957976725805430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15189458367667507357.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/LTL1191795...247
Read 1 LTL properties
Checking formula 0 : !((G(X((G(F("((i0.u0.s1<1)||(u7.l90<1))")))||(F("((i0.u0.s1<1)||(u7.l90<1))"))))))
Formula 0 simplified : !GX(F"((i0.u0.s1<1)||(u7.l90<1))" | GF"((i0.u0.s1<1)||(u7.l90<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13254345349452692591
[2022-06-11 11:43:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13254345349452692591
Running compilation step : cd /tmp/ltsmin13254345349452692591;'/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/ltsmin13254345349452692591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13254345349452692591;'/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(([](<>((LTLAPp0==true)))||<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 finished in 77876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!F(X(!p0)) U (X(F(X(p1)))||p2)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 60 transition count 62
Applied a total of 15 rules in 2 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:41] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR p1 p2), (OR p1 (AND p0 p2)), p1, (OR p0 p1), (OR p1 (AND p0 p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s57 1)), p0:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22470 reset in 100 ms.
Product exploration explored 100000 steps with 22383 reset in 144 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 559 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, p1, p1, p1]
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 10 ms. (steps per millisecond=140 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 10 ms. (steps per millisecond=140 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 508 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[true, p1, p1, p1]
Stuttering acceptance computed with spot in 93 ms :[true, p1, p1, p1]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 1 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 11:43:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:43] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:43] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:43] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 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 : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[true, p1, p1, p1]
Incomplete random walk after 10000 steps, including 2182 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 1069 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 18 ms. (steps per millisecond=78 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 18 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[true, p1, p1, p1]
Stuttering acceptance computed with spot in 88 ms :[true, p1, p1, p1]
Stuttering acceptance computed with spot in 94 ms :[true, p1, p1, p1]
Product exploration explored 100000 steps with 22314 reset in 89 ms.
Product exploration explored 100000 steps with 22400 reset in 110 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, p1, p1, p1]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2022-06-11 11:43:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:43:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Product exploration explored 100000 steps with 22199 reset in 236 ms.
Product exploration explored 100000 steps with 22556 reset in 224 ms.
Built C files in :
/tmp/ltsmin627631915082625703
[2022-06-11 11:43:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin627631915082625703
Running compilation step : cd /tmp/ltsmin627631915082625703;'/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 175 ms.
Running link step : cd /tmp/ltsmin627631915082625703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin627631915082625703;'/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/stateBased11866259262601591588.hoa' '--buchi-type=spotba'
LTSmin run took 9235 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 finished in 13409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(X(p0))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 3 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:43:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:54] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:43:54] [INFO ] Computed 5 place invariants in 15 ms
[2022-06-11 11:43:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:43:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:54] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s56 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, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-12 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(F(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 61 transition count 63
Applied a total of 13 rules in 15 ms. Remains 61 /67 variables (removed 6) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:55] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:43:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-06-11 11:43:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/67 places, 63/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 63/70 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s20 1)), p1:(AND (OR (LT s10 1) (LT s20 1)) (OR (LT s15 1) (LT s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22305 reset in 119 ms.
Product exploration explored 100000 steps with 22412 reset in 108 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 483 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 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2207 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:43:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:43:56] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 11:43:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 11:43:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:43:56] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 11:43:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:56] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 11:43:56] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-11 11:43:56] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 168 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 59 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 60
Applied a total of 5 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 60/63 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 60/63 transitions.
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 992 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 970 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1352 steps, run visited all 2 properties in 9 ms. (steps per millisecond=150 )
Probabilistic random walk after 1352 steps, saw 684 distinct states, run finished after 18 ms. (steps per millisecond=75 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 528 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 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 7 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 11:43:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:57] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:43:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:57] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-06-11 11:43:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:57] [INFO ] Dead Transitions using invariants and state equation in 50 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 250 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 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1050 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:43:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:43:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 11:43:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:43:58] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 11:43:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:43:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:43:58] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 11:43:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:43:58] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 11:43:58] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-11 11:43:58] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 168 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 59 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 60
Applied a total of 5 rules in 3 ms. Remains 59 /61 variables (removed 2) and now considering 60/63 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 60/63 transitions.
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1015 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1352 steps, run visited all 2 properties in 6 ms. (steps per millisecond=225 )
Probabilistic random walk after 1352 steps, saw 684 distinct states, run finished after 6 ms. (steps per millisecond=225 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 483 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 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22310 reset in 97 ms.
Product exploration explored 100000 steps with 22318 reset in 95 ms.
Built C files in :
/tmp/ltsmin5638037049099194680
[2022-06-11 11:43:59] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2022-06-11 11:43:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:43:59] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2022-06-11 11:43:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:43:59] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2022-06-11 11:43:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:43:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5638037049099194680
Running compilation step : cd /tmp/ltsmin5638037049099194680;'/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 140 ms.
Running link step : cd /tmp/ltsmin5638037049099194680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5638037049099194680;'/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/stateBased10800968067769990039.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 4 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 11:44:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:44:14] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:44:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:44:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:44:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-11 11:44:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 11:44:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:44:15] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin5611735417058475750
[2022-06-11 11:44:15] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2022-06-11 11:44:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:44:15] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2022-06-11 11:44:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:44:15] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2022-06-11 11:44:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:44:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5611735417058475750
Running compilation step : cd /tmp/ltsmin5611735417058475750;'/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 135 ms.
Running link step : cd /tmp/ltsmin5611735417058475750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin5611735417058475750;'/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/stateBased5329914591307656074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:44:30] [INFO ] Flatten gal took : 12 ms
[2022-06-11 11:44:30] [INFO ] Flatten gal took : 3 ms
[2022-06-11 11:44:30] [INFO ] Time to serialize gal into /tmp/LTL10925735882006666879.gal : 17 ms
[2022-06-11 11:44:30] [INFO ] Time to serialize properties into /tmp/LTL10277618817710097508.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/LTL10925735882006666879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10277618817710097508.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/LTL1092573...268
Read 1 LTL properties
Checking formula 0 : !(((G("((p17<1)||(l0<1))"))||(F(G(F("(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))"))))))
Formula 0 simplified : !(G"((p17<1)||(l0<1))" | FGF"(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))")
Detected timeout of ITS tools.
[2022-06-11 11:44:45] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:44:45] [INFO ] Applying decomposition
[2022-06-11 11:44:45] [INFO ] Flatten gal took : 3 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/graph17624619851344499775.txt' '-o' '/tmp/graph17624619851344499775.bin' '-w' '/tmp/graph17624619851344499775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17624619851344499775.bin' '-l' '-1' '-v' '-w' '/tmp/graph17624619851344499775.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:44:45] [INFO ] Decomposing Gal with order
[2022-06-11 11:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:44:45] [INFO ] Removed a total of 53 redundant transitions.
[2022-06-11 11:44:45] [INFO ] Flatten gal took : 9 ms
[2022-06-11 11:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 2 ms.
[2022-06-11 11:44:45] [INFO ] Time to serialize gal into /tmp/LTL6860233059492835640.gal : 3 ms
[2022-06-11 11:44:45] [INFO ] Time to serialize properties into /tmp/LTL18282426961959407761.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/LTL6860233059492835640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18282426961959407761.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/LTL6860233...246
Read 1 LTL properties
Checking formula 0 : !(((G("((i6.u7.p17<1)||(i5.u0.l0<1))"))||(F(G(F("(((i3.u6.p11<1)||(i5.u0.l0<1))&&((i6.u7.p17<1)||(i5.u0.l0<1)))"))))))
Formula 0 simplified : !(G"((i6.u7.p17<1)||(i5.u0.l0<1))" | FGF"(((i3.u6.p11<1)||(i5.u0.l0<1))&&((i6.u7.p17<1)||(i5.u0.l0<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14140931165238250446
[2022-06-11 11:45:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14140931165238250446
Running compilation step : cd /tmp/ltsmin14140931165238250446;'/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 138 ms.
Running link step : cd /tmp/ltsmin14140931165238250446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14140931165238250446;'/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' '([]((LTLAPp0==true))||<>([](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-13 finished in 80465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U !p1)||(X(F(p2))&&X(X(p3)))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 3 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:45:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:45:15] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:45:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:45:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:45:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:45:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:45:15] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s30 1)), p0:(AND (GEQ s1 1) (GEQ s47 1)), p2:(OR (LT s1 1) (LT s51 1)), p3:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 finished in 899 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(p0))||F(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(F(p1)))))'
[2022-06-11 11:45:16] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1349860785900047834
[2022-06-11 11:45:16] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2022-06-11 11:45:16] [INFO ] Applying decomposition
[2022-06-11 11:45:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:45:16] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2022-06-11 11:45:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:45:16] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2022-06-11 11:45:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:45:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1349860785900047834
[2022-06-11 11:45:16] [INFO ] Flatten gal took : 4 ms
Running compilation step : cd /tmp/ltsmin1349860785900047834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph1485711063325924423.txt' '-o' '/tmp/graph1485711063325924423.bin' '-w' '/tmp/graph1485711063325924423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1485711063325924423.bin' '-l' '-1' '-v' '-w' '/tmp/graph1485711063325924423.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:45:16] [INFO ] Decomposing Gal with order
[2022-06-11 11:45:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:45:16] [INFO ] Removed a total of 63 redundant transitions.
[2022-06-11 11:45:16] [INFO ] Flatten gal took : 25 ms
[2022-06-11 11:45:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 3 ms.
[2022-06-11 11:45:16] [INFO ] Time to serialize gal into /tmp/LTLFireability18266168164704015303.gal : 2 ms
[2022-06-11 11:45:16] [INFO ] Time to serialize properties into /tmp/LTLFireability2760494171945610929.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/LTLFireability18266168164704015303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2760494171945610929.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 2 LTL properties
Checking formula 0 : !((G(X((G(F("((i0.i1.u0.s1<1)||(u8.l90<1))")))||(F("((i0.i1.u0.s1<1)||(u8.l90<1))"))))))
Formula 0 simplified : !GX(F"((i0.i1.u0.s1<1)||(u8.l90<1))" | GF"((i0.i1.u0.s1<1)||(u8.l90<1))")
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin1349860785900047834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1349860785900047834;'/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(([](<>((LTLAPp0==true)))||<>((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: [](X(([](<>((LTLAPp0==true)))||<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "[](X(([](<>((LTLAPp0==true)))||<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.044: DFS-FIFO for weak LTL, using special progress label 74
pins2lts-mc-linux64( 0/ 8), 0.044: There are 75 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.044: State length is 68, there are 73 groups
pins2lts-mc-linux64( 0/ 8), 0.044: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.044: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.044: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.044: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.065: ~5 levels ~960 states ~1992 transitions
pins2lts-mc-linux64( 0/ 8), 0.067: ~5 levels ~1920 states ~3720 transitions
pins2lts-mc-linux64( 0/ 8), 0.301: ~5 levels ~3840 states ~7440 transitions
pins2lts-mc-linux64( 0/ 8), 0.703: ~7 levels ~7680 states ~15664 transitions
pins2lts-mc-linux64( 0/ 8), 1.075: ~8 levels ~15360 states ~33208 transitions
pins2lts-mc-linux64( 3/ 8), 1.315: ~8 levels ~30720 states ~67912 transitions
pins2lts-mc-linux64( 0/ 8), 1.705: ~10 levels ~61440 states ~135784 transitions
pins2lts-mc-linux64( 2/ 8), 2.577: ~11 levels ~122880 states ~284712 transitions
pins2lts-mc-linux64( 0/ 8), 3.998: ~12 levels ~245760 states ~568176 transitions
pins2lts-mc-linux64( 6/ 8), 6.131: ~11 levels ~491520 states ~1114448 transitions
pins2lts-mc-linux64( 3/ 8), 9.047: ~15 levels ~983040 states ~2252936 transitions
pins2lts-mc-linux64( 5/ 8), 13.413: ~13 levels ~1966080 states ~4756920 transitions
pins2lts-mc-linux64( 6/ 8), 20.561: ~15 levels ~3932160 states ~9279736 transitions
pins2lts-mc-linux64( 6/ 8), 31.520: ~17 levels ~7864320 states ~18700104 transitions
pins2lts-mc-linux64( 6/ 8), 50.032: ~18 levels ~15728640 states ~37754248 transitions
pins2lts-mc-linux64( 1/ 8), 77.792: ~19 levels ~31457280 states ~78154160 transitions
pins2lts-mc-linux64( 6/ 8), 130.542: ~25 levels ~62914560 states ~151381384 transitions
pins2lts-mc-linux64( 3/ 8), 237.036: ~31 levels ~125829120 states ~303164040 transitions
pins2lts-mc-linux64( 4/ 8), 276.774: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 276.899:
pins2lts-mc-linux64( 0/ 8), 276.899: mean standard work distribution: 4.2% (states) 4.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 276.899:
pins2lts-mc-linux64( 0/ 8), 276.899: Explored 131610319 states 324375035 transitions, fanout: 2.465
pins2lts-mc-linux64( 0/ 8), 276.899: Total exploration time 276.830 sec (276.660 sec minimum, 276.719 sec on average)
pins2lts-mc-linux64( 0/ 8), 276.899: States per second: 475419, Transitions per second: 1171748
pins2lts-mc-linux64( 0/ 8), 276.899:
pins2lts-mc-linux64( 0/ 8), 276.899: Progress states detected: 127397573
pins2lts-mc-linux64( 0/ 8), 276.899: Redundant explorations: -1.9424
pins2lts-mc-linux64( 0/ 8), 276.899:
pins2lts-mc-linux64( 0/ 8), 276.899: Queue width: 8B, total height: 5953092, memory: 45.42MB
pins2lts-mc-linux64( 0/ 8), 276.899: Tree memory: 1036.1MB, 8.1 B/state, compr.: 3.0%
pins2lts-mc-linux64( 0/ 8), 276.899: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 276.899: Stored 70 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 276.899: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 276.899: Est. total memory use: 1081.6MB (~1069.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1349860785900047834;'/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(([](<>((LTLAPp0==true)))||<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1349860785900047834;'/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(([](<>((LTLAPp0==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 12:06:18] [INFO ] Flatten gal took : 15 ms
[2022-06-11 12:06:18] [INFO ] Time to serialize gal into /tmp/LTLFireability8035693688645300618.gal : 3 ms
[2022-06-11 12:06:18] [INFO ] Time to serialize properties into /tmp/LTLFireability5528428120222225957.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/LTLFireability8035693688645300618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5528428120222225957.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...288
Read 2 LTL properties
Checking formula 0 : !((G(X((G(F("((s1<1)||(l90<1))")))||(F("((s1<1)||(l90<1))"))))))
Formula 0 simplified : !GX(F"((s1<1)||(l90<1))" | GF"((s1<1)||(l90<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t8, t19, t25, t35, t46, t50, t51, t52, t53, t54, t55, t56, t57, t59, t60, t61, t62, t...277
Computing Next relation with stutter on 8.36902e+11 deadlock states
2833 unique states visited
0 strongly connected components in search stack
2834 transitions explored
1418 items max in DFS search stack
33229 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,332.297,2211288,1,0,12132,1.0795e+07,23,9639,1502,1.19314e+07,36453
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G("((p17<1)||(l0<1))"))||(F(G(F("(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))"))))))
Formula 1 simplified : !(G"((p17<1)||(l0<1))" | FGF"(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))")
Computing Next relation with stutter on 8.36902e+11 deadlock states
Detected timeout of ITS tools.
[2022-06-11 12:27:20] [INFO ] Flatten gal took : 7 ms
[2022-06-11 12:27:20] [INFO ] Input system was already deterministic with 70 transitions.
[2022-06-11 12:27:20] [INFO ] Transformed 67 places.
[2022-06-11 12:27:20] [INFO ] Transformed 70 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 12:27:20] [INFO ] Time to serialize gal into /tmp/LTLFireability2851835542544536088.gal : 0 ms
[2022-06-11 12:27:20] [INFO ] Time to serialize properties into /tmp/LTLFireability8527920987631640927.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/LTLFireability2851835542544536088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8527920987631640927.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...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p17<1)||(l0<1))"))||(F(G(F("(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))"))))))
Formula 0 simplified : !(G"((p17<1)||(l0<1))" | FGF"(((p11<1)||(l0<1))&&((p17<1)||(l0<1)))")

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-d0m64"
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-d0m64, 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-165472282900876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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