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.r078-tall-165260109900172.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109900172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 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 DoubleExponent-PT-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652638273772

Running Version 202205111006
[2022-05-15 18:11:14] [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-05-15 18:11:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:11:15] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-15 18:11:15] [INFO ] Transformed 110 places.
[2022-05-15 18:11:15] [INFO ] Transformed 98 transitions.
[2022-05-15 18:11:15] [INFO ] Parsed PT model containing 110 places and 98 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 16 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:15] [INFO ] Computed 11 place invariants in 14 ms
[2022-05-15 18:11:15] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:15] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:11:15] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:15] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-15 18:11:15] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/110 places, 98/98 transitions.
Support contains 44 out of 106 places after structural reductions.
[2022-05-15 18:11:15] [INFO ] Flatten gal took : 30 ms
[2022-05-15 18:11:15] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:11:15] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 43 out of 106 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 1100 ms. (steps per millisecond=9 ) properties (out of 29) seen :15
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:18] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:11:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-15 18:11:18] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-15 18:11:18] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 18:11:18] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-15 18:11:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 18:11:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:18] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 18:11:18] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-15 18:11:18] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 38 ms.
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 106 transition count 79
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 87 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 86 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 86 transition count 72
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 80 transition count 72
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 61 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 59 transition count 53
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 59 transition count 49
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 55 transition count 49
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 110 place count 55 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 54 transition count 48
Applied a total of 111 rules in 45 ms. Remains 54 /106 variables (removed 52) and now considering 48/98 (removed 50) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/106 places, 48/98 transitions.
Incomplete random walk after 10000 steps, including 1123 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 773 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 760 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Finished probabilistic random walk after 2042 steps, run visited all 4 properties in 26 ms. (steps per millisecond=78 )
Probabilistic random walk after 2042 steps, saw 1051 distinct states, run finished after 26 ms. (steps per millisecond=78 ) properties seen :4
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((F(p1)||p2))&&p0))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 106 transition count 81
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 89 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 86 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 86 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 80 transition count 72
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 84 place count 64 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 62 transition count 56
Applied a total of 88 rules in 12 ms. Remains 62 /106 variables (removed 44) and now considering 56/98 (removed 42) transitions.
// Phase 1: matrix 56 rows 62 cols
[2022-05-15 18:11:19] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 18:11:19] [INFO ] Implicit Places using invariants in 72 ms returned [42, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/106 places, 56/98 transitions.
Graph (complete) has 157 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 56 transition count 52
Applied a total of 7 rules in 6 ms. Remains 56 /60 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:19] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/106 places, 52/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/106 places, 52/98 transitions.
Stuttering acceptance computed with spot in 1362 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s46 1) (OR (LT s9 1) (LT s45 1) (LT s36 1))), p2:(GEQ s41 1), p1:(LT s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11691 reset in 242 ms.
Product exploration explored 100000 steps with 11570 reset in 154 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Graph (complete) has 153 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/56 stabilizing places and 5/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 633 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 808 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 578 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 571 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:22] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:22] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-15 18:11:22] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:22] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-15 18:11:22] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 18:11:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:22] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 18:11:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2022-05-15 18:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-15 18:11:22] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 18:11:22] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 52/52 transitions.
Graph (complete) has 147 edges and 56 vertex of which 55 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 55 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 53 transition count 49
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 53 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 48 transition count 44
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 23 place count 48 transition count 44
Applied a total of 23 rules in 9 ms. Remains 48 /56 variables (removed 8) and now considering 44/52 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/56 places, 44/52 transitions.
Incomplete random walk after 10000 steps, including 775 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished Best-First random walk after 4328 steps, including 250 resets, run visited all 1 properties in 5 ms. (steps per millisecond=865 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 432 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 52/52 transitions.
Applied a total of 0 rules in 8 ms. Remains 56 /56 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:23] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:23] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:23] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:23] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-15 18:11:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:23] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Graph (complete) has 153 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/56 stabilizing places and 5/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 813 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 586 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 56 cols
[2022-05-15 18:11:23] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:24] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:24] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:11:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:24] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:24] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:11:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:24] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 18:11:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2022-05-15 18:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-15 18:11:24] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 18:11:24] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 52/52 transitions.
Graph (complete) has 147 edges and 56 vertex of which 55 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 55 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 53 transition count 49
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 53 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 48 transition count 44
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 23 place count 48 transition count 44
Applied a total of 23 rules in 9 ms. Remains 48 /56 variables (removed 8) and now considering 44/52 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/56 places, 44/52 transitions.
Finished random walk after 3953 steps, including 308 resets, run visited all 1 properties in 5 ms. (steps per millisecond=790 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 11640 reset in 119 ms.
Product exploration explored 100000 steps with 11579 reset in 179 ms.
Built C files in :
/tmp/ltsmin757457968186938058
[2022-05-15 18:11:25] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-15 18:11:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:11:25] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-15 18:11:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:11:25] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-15 18:11:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:11:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin757457968186938058
Running compilation step : cd /tmp/ltsmin757457968186938058;'/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 224 ms.
Running link step : cd /tmp/ltsmin757457968186938058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin757457968186938058;'/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/stateBased16590448465552446925.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 5794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p0))&&p1)))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:25] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:11:25] [INFO ] Implicit Places using invariants in 54 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 8 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2022-05-15 18:11:25] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:11:25] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 97 rows 104 cols
[2022-05-15 18:11:25] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-15 18:11:25] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s73 1) (GEQ s88 1)), p1:(LT s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-01 finished in 358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((!X(!G(p0)) U G(X(p1))))||G(p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:25] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:25] [INFO ] Implicit Places using invariants in 47 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 98/98 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s31 1)), p1:(AND (GEQ s75 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(X(p0))&&X(p1))))&&F(p2)))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants in 51 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s46 1), p1:(GEQ s0 1), p0:(OR (LT s24 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:26] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants in 47 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:26] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-15 18:11:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 452 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s102 1)), p0:(AND (GEQ s24 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-05 finished in 672 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:27] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants in 48 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:27] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:27] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-06 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:27] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants in 56 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:27] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:27] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s27 1), p0:(AND (GEQ s1 1) (GEQ s102 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]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-07 finished in 308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1))&&G(F(p0)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:27] [INFO ] Implicit Places using invariants in 42 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2022-05-15 18:11:27] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:11:28] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 97 rows 104 cols
[2022-05-15 18:11:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:11:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s32 1)), p1:(OR (AND (GEQ s73 1) (GEQ s80 1)) (GEQ s17 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-08 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(p0)) U (F(!p1)&&X(p2))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:28] [INFO ] Implicit Places using invariants in 52 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:28] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p0 p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), p0, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(AND (GEQ s12 1) (GEQ s35 1)), p2:(AND (GEQ s45 1) (GEQ s92 1)), p0:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/103 stabilizing places and 7/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0 (NOT p2))))
Knowledge based reduction with 14 factoid took 209 ms. Reduced automaton from 9 states, 22 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 1052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 46 place count 82 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 78 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 57 transition count 51
Applied a total of 95 rules in 19 ms. Remains 57 /106 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2022-05-15 18:11:29] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants in 44 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/106 places, 51/98 transitions.
Graph (complete) has 146 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 51 transition count 47
Applied a total of 7 rules in 3 ms. Remains 51 /55 variables (removed 4) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 51 cols
[2022-05-15 18:11:29] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2022-05-15 18:11:29] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/106 places, 47/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/106 places, 47/98 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s34 1)), p0:(GEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-10 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((F(p0) U G(p1)))&&p2)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants in 44 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:29] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:29] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:29] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s58 1) (LT s90 1)), p1:(GEQ s18 1), p0:(GEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 29948 steps with 1869 reset in 32 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-11 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&X(G((!(p0 U p2)&&!p2)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants in 52 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 98/98 transitions.
Stuttering acceptance computed with spot in 125 ms :[p2, (OR (NOT p1) p2), true, (OR (NOT p1) p2)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s75 1) (GEQ s93 1)), p1:(GEQ s25 1), p0:(AND (GEQ s37 1) (GEQ s57 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants in 52 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:30] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:30] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-13 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-13 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||((p1 U p2)&&X(F(X(X(p3)))))))'
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants in 51 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:30] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:30] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:30] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 461 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s31 1)), p1:(GEQ s19 1), p0:(AND (GEQ s24 1) (GEQ s44 1)), p3:(AND (GEQ s59 1) (GEQ s77 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, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(X(X(p0))))||X(p0)))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2022-05-15 18:11:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:11:31] [INFO ] Implicit Places using invariants in 57 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:31] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:31] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2022-05-15 18:11:31] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:31] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s6 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-15 finished in 307 ms.
All properties solved by simple procedures.
Total runtime 16634 ms.

BK_STOP 1652638291649

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r078-tall-165260109900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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