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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:48 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:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 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 50K 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-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652639322742

Running Version 202205111006
[2022-05-15 18:28:43] [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:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:28:44] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-15 18:28:44] [INFO ] Transformed 163 places.
[2022-05-15 18:28:44] [INFO ] Transformed 148 transitions.
[2022-05-15 18:28:44] [INFO ] Parsed PT model containing 163 places and 148 transitions in 167 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 3 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 22 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2022-05-15 18:28:44] [INFO ] Computed 16 place invariants in 18 ms
[2022-05-15 18:28:44] [INFO ] Implicit Places using invariants in 210 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 157/163 places, 148/148 transitions.
Support contains 36 out of 157 places after structural reductions.
[2022-05-15 18:28:44] [INFO ] Flatten gal took : 39 ms
[2022-05-15 18:28:44] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:28:44] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 33 out of 157 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 148 rows 157 cols
[2022-05-15 18:28:45] [INFO ] Computed 14 place invariants in 12 ms
[2022-05-15 18:28:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:28:45] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 18:28:46] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:8
[2022-05-15 18:28:46] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 5 ms to minimize.
[2022-05-15 18:28:46] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-15 18:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2022-05-15 18:28:46] [INFO ] After 540ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-15 18:28:46] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
[2022-05-15 18:28:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2022-05-15 18:28:46] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 18:28:47] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-15 18:28:47] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 2 ms to minimize.
[2022-05-15 18:28:47] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2022-05-15 18:28:47] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 130 ms.
[2022-05-15 18:28:47] [INFO ] After 1204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 251 ms.
Support contains 23 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 155 transition count 128
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 137 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 131 transition count 122
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 50 place count 131 transition count 113
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 68 place count 122 transition count 113
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 112 place count 100 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 97 transition count 91
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 97 transition count 85
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 130 place count 91 transition count 85
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 140 place count 91 transition count 85
Applied a total of 140 rules in 37 ms. Remains 91 /157 variables (removed 66) and now considering 85/148 (removed 63) transitions.
Finished structural reductions, in 1 iterations. Remains : 91/157 places, 85/148 transitions.
Incomplete random walk after 10000 steps, including 868 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 85 rows 91 cols
[2022-05-15 18:28:48] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 18:28:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 18:28:48] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-15 18:28:48] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-15 18:28:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:28:48] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-15 18:28:48] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-15 18:28:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:28:48] [INFO ] After 67ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-05-15 18:28:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-05-15 18:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-05-15 18:28:48] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-15 18:28:48] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2022-05-15 18:28:48] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-05-15 18:28:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2022-05-15 18:28:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:28:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2022-05-15 18:28:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:28:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2022-05-15 18:28:49] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-15 18:28:49] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 131 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 91/91 places, 85/85 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 89 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 85 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 85 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 84 transition count 78
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 84 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 83 transition count 77
Applied a total of 17 rules in 26 ms. Remains 83 /91 variables (removed 8) and now considering 77/85 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/91 places, 77/85 transitions.
Incomplete random walk after 10000 steps, including 1158 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 770 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 778 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 768 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 781 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 787 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 754 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 787 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 742 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 766 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 779 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 760 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Finished probabilistic random walk after 95401 steps, run visited all 12 properties in 282 ms. (steps per millisecond=338 )
Probabilistic random walk after 95401 steps, saw 47738 distinct states, run finished after 283 ms. (steps per millisecond=337 ) properties seen :12
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 157 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 76 transition count 71
Applied a total of 158 rules in 21 ms. Remains 76 /157 variables (removed 81) and now considering 71/148 (removed 77) transitions.
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:52] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:28:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:52] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-05-15 18:28:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 18:28:52] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/157 places, 71/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/157 places, 71/148 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 76 transition count 71
Applied a total of 158 rules in 21 ms. Remains 76 /157 variables (removed 81) and now considering 71/148 (removed 77) transitions.
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:52] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:52] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-15 18:28:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/157 places, 71/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/157 places, 71/148 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13915 reset in 236 ms.
Product exploration explored 100000 steps with 13900 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 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 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 791 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3174 steps, run visited all 1 properties in 13 ms. (steps per millisecond=244 )
Probabilistic random walk after 3174 steps, saw 1614 distinct states, run finished after 13 ms. (steps per millisecond=244 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 71/71 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:53] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 18:28:53] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:54] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-15 18:28:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:28:54] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:54] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 71/71 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1388 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3174 steps, run visited all 1 properties in 9 ms. (steps per millisecond=352 )
Probabilistic random walk after 3174 steps, saw 1614 distinct states, run finished after 9 ms. (steps per millisecond=352 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13907 reset in 96 ms.
Product exploration explored 100000 steps with 13788 reset in 158 ms.
Built C files in :
/tmp/ltsmin6320827991383646694
[2022-05-15 18:28:54] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2022-05-15 18:28:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:28:54] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2022-05-15 18:28:54] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:28:54] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2022-05-15 18:28:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:28:54] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6320827991383646694
Running compilation step : cd /tmp/ltsmin6320827991383646694;'/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 273 ms.
Running link step : cd /tmp/ltsmin6320827991383646694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6320827991383646694;'/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/stateBased5043399465518678031.hoa' '--buchi-type=spotba'
LTSmin run took 6395 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-01 finished in 8760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U G(X(G((p1 U p2))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 12 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:01] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 18:29:01] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:01] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:01] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 150 ms :[p2, p2, (AND p0 p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s143 1), p1:(GEQ s4 1), p2:(AND (GEQ s134 1) (GEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33338 reset in 182 ms.
Product exploration explored 100000 steps with 33293 reset in 151 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[p2, p2, (AND p0 p2)]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1782 steps, run visited all 3 properties in 12 ms. (steps per millisecond=148 )
Probabilistic random walk after 1782 steps, saw 900 distinct states, run finished after 12 ms. (steps per millisecond=148 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 121 ms :[p2, p2, (AND p0 p2)]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:03] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:03] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:03] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 18:29:04] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:04] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:04] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[p2, p2, (AND p0 p2)]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1782 steps, run visited all 3 properties in 10 ms. (steps per millisecond=178 )
Probabilistic random walk after 1782 steps, saw 900 distinct states, run finished after 10 ms. (steps per millisecond=178 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 384 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 111 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 125 ms :[p2, p2, (AND p0 p2)]
Product exploration explored 100000 steps with 33202 reset in 123 ms.
Product exploration explored 100000 steps with 33347 reset in 127 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 124 ms :[p2, p2, (AND p0 p2)]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 32 place count 155 transition count 151
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 155 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 151 transition count 147
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 151 transition count 147
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 76 place count 151 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 150 transition count 150
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 150 transition count 150
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 150 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 143 transition count 166
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 143 transition count 166
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 98 rules in 31 ms. Remains 143 /156 variables (removed 13) and now considering 166/147 (removed -19) transitions.
[2022-05-15 18:29:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 166 rows 143 cols
[2022-05-15 18:29:06] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:06] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/156 places, 166/147 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/156 places, 166/147 transitions.
Product exploration explored 100000 steps with 33421 reset in 434 ms.
Product exploration explored 100000 steps with 33467 reset in 422 ms.
Built C files in :
/tmp/ltsmin8755905685089559285
[2022-05-15 18:29:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8755905685089559285
Running compilation step : cd /tmp/ltsmin8755905685089559285;'/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 237 ms.
Running link step : cd /tmp/ltsmin8755905685089559285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8755905685089559285;'/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/stateBased1617442930823659096.hoa' '--buchi-type=spotba'
LTSmin run took 14530 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-02 finished in 20805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((G(p0)||!p0))||F(p1)) U p2)))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 7 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:22] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:22] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:22] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:22] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 18:29:22] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s30 1), p0:(AND (GEQ s6 1) (GEQ s81 1)), p1:(AND (GEQ s72 1) (GEQ s88 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]]
Product exploration explored 100000 steps with 3466 reset in 96 ms.
Product exploration explored 100000 steps with 3433 reset in 138 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:24] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:24] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 18:29:24] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 18:29:24] [INFO ] After 66ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 18:29:24] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-15 18:29:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:24] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:24] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 18:29:24] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2022-05-15 18:29:24] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2022-05-15 18:29:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2022-05-15 18:29:24] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-05-15 18:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-15 18:29:24] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-15 18:29:24] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 154 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 120 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 118 transition count 109
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 74 place count 118 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 88 place count 111 transition count 102
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 144 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 152 place count 79 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 79 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 70 transition count 65
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 181 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 69 transition count 64
Applied a total of 182 rules in 18 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1017 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 732 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 64 rows 69 cols
[2022-05-15 18:29:24] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:24] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:24] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 18:29:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-15 18:29:24] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:29:24] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:29:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:24] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2022-05-15 18:29:25] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:29:25] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 18:29:25] [INFO ] After 10ms 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:29:25] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 64/64 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 67 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 66 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 66 transition count 61
Applied a total of 7 rules in 11 ms. Remains 66 /69 variables (removed 3) and now considering 61/64 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/69 places, 61/64 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2022 steps, run visited all 1 properties in 8 ms. (steps per millisecond=252 )
Probabilistic random walk after 2022 steps, saw 1041 distinct states, run finished after 8 ms. (steps per millisecond=252 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:25] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:25] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:26] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-15 18:29:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:29:26] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 9 ms returned sat
[2022-05-15 18:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:26] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-15 18:29:26] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-15 18:29:26] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2022-05-15 18:29:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-15 18:29:26] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2022-05-15 18:29:26] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2022-05-15 18:29:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 284 ms
[2022-05-15 18:29:26] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 18:29:27] [INFO ] Added : 142 causal constraints over 29 iterations in 565 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:27] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:27] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:27] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 18:29:27] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:27] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 18:29:27] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 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
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 667 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:28] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:29:28] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:28] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 18:29:28] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 18:29:28] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-15 18:29:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:28] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2022-05-15 18:29:28] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 18:29:28] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2022-05-15 18:29:28] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:29:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2022-05-15 18:29:29] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-05-15 18:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-15 18:29:29] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-15 18:29:29] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 154 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 120 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 118 transition count 109
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 74 place count 118 transition count 102
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 88 place count 111 transition count 102
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 144 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 152 place count 79 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 79 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 70 transition count 65
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 181 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 69 transition count 64
Applied a total of 182 rules in 14 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1052 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 752 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 69 cols
[2022-05-15 18:29:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 18:29:29] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 2 ms returned sat
[2022-05-15 18:29:29] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 18:29:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-15 18:29:29] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:29:29] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:29:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:29] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:29] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:29:29] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 18:29:29] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 18:29:29] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 64/64 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 67 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 66 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 66 transition count 61
Applied a total of 7 rules in 20 ms. Remains 66 /69 variables (removed 3) and now considering 61/64 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/69 places, 61/64 transitions.
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2022 steps, run visited all 1 properties in 8 ms. (steps per millisecond=252 )
Probabilistic random walk after 2022 steps, saw 1041 distinct states, run finished after 8 ms. (steps per millisecond=252 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 620 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:30] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:29:30] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:30] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-15 18:29:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:29:30] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:30] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-15 18:29:30] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:29:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-15 18:29:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-15 18:29:31] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 9 ms to minimize.
[2022-05-15 18:29:31] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-15 18:29:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 281 ms
[2022-05-15 18:29:31] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-15 18:29:31] [INFO ] Added : 142 causal constraints over 29 iterations in 530 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3417 reset in 93 ms.
Product exploration explored 100000 steps with 3450 reset in 116 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 155 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 34 place count 155 transition count 151
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 155 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 151 transition count 147
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 151 transition count 147
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 78 place count 151 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 150 transition count 152
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 150 transition count 152
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 150 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 143 transition count 162
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 143 transition count 162
Deduced a syphon composed of 63 places in 1 ms
Applied a total of 100 rules in 22 ms. Remains 143 /156 variables (removed 13) and now considering 162/147 (removed -15) transitions.
[2022-05-15 18:29:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 162 rows 143 cols
[2022-05-15 18:29:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/156 places, 162/147 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/156 places, 162/147 transitions.
Stuttering criterion allowed to conclude after 6780 steps with 622 reset in 13 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-03 finished in 10133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:32] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:32] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:32] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:32] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 705 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s80 1), p0:(OR (LT s23 1) (LT s103 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]]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/156 stabilizing places and 7/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-003-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-05 finished in 1416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 1 out of 157 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 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 111
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 120 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 118 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 75 place count 118 transition count 103
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 87 place count 112 transition count 103
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 143 place count 84 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 81 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 80 transition count 74
Applied a total of 150 rules in 14 ms. Remains 80 /157 variables (removed 77) and now considering 74/148 (removed 74) transitions.
// Phase 1: matrix 74 rows 80 cols
[2022-05-15 18:29:33] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:33] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 74 rows 80 cols
[2022-05-15 18:29:33] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:29:34] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-15 18:29:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 74 rows 80 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-15 18:29:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/157 places, 74/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/157 places, 74/148 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 228 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/80 stabilizing places and 2/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-003-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-06 finished in 577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:34] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:34] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:34] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s135 1), p1:(GEQ s41 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-08 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F(p1)||p0)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 7 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:34] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:35] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:35] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s92 1) (GEQ s134 1)), p1:(GEQ s90 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 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(p0))||p0))))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 76 transition count 71
Applied a total of 158 rules in 17 ms. Remains 76 /157 variables (removed 81) and now considering 71/148 (removed 77) transitions.
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:35] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:35] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-15 18:29:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:29:35] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-05-15 18:29:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/157 places, 71/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/157 places, 71/148 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11 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:(LT s70 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 13777 reset in 91 ms.
Product exploration explored 100000 steps with 13860 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 779 steps, run visited all 1 properties in 6 ms. (steps per millisecond=129 )
Probabilistic random walk after 779 steps, saw 399 distinct states, run finished after 6 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:36] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:36] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:29:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-15 18:29:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 76 cols
[2022-05-15 18:29:36] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-15 18:29:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 71/71 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 779 steps, run visited all 1 properties in 9 ms. (steps per millisecond=86 )
Probabilistic random walk after 779 steps, saw 399 distinct states, run finished after 9 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13934 reset in 87 ms.
Product exploration explored 100000 steps with 13931 reset in 91 ms.
Built C files in :
/tmp/ltsmin15431360536538057861
[2022-05-15 18:29:37] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2022-05-15 18:29:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:29:37] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2022-05-15 18:29:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:29:37] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2022-05-15 18:29:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:29:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15431360536538057861
Running compilation step : cd /tmp/ltsmin15431360536538057861;'/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/ltsmin15431360536538057861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15431360536538057861;'/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/stateBased15506583990676780131.hoa' '--buchi-type=spotba'
LTSmin run took 3506 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 5698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((!F(p0)||X(p1)||p1))) U X(p0)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:41] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:41] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), true, p0]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, 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 p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s104 1), p1:(AND (GEQ s11 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-12 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 153 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 78 transition count 73
Applied a total of 154 rules in 14 ms. Remains 78 /157 variables (removed 79) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:29:41] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:29:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-15 18:29:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/157 places, 73/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s61 1) (GEQ s75 1)), p0:(GEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-13 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U p1))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:41] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:42] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:42] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2022-05-15 18:29:42] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:42] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s68 1) (AND (GEQ s134 1) (GEQ s153 1))), p0:(GEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))&&(X(p2)||p3))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 157 cols
[2022-05-15 18:29:42] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:29:42] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 148 rows 157 cols
[2022-05-15 18:29:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:42] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 157 cols
[2022-05-15 18:29:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:29:42] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 148/148 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s120 1), p3:(GEQ s144 1), p1:(OR (GEQ s144 1) (GEQ s151 1)), p2:(GEQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 693 ms.
All properties solved by simple procedures.
Total runtime 59237 ms.

BK_STOP 1652639383253

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
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-003, 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-165260110000180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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