Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418500468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 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-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678861385589

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 06:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 06:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 06:23:08] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-15 06:23:08] [INFO ] Transformed 216 places.
[2023-03-15 06:23:08] [INFO ] Transformed 198 transitions.
[2023-03-15 06:23:08] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-004-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 37 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2023-03-15 06:23:08] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-15 06:23:09] [INFO ] Implicit Places using invariants in 470 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 515 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 43 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 06:23:09] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-15 06:23:09] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-15 06:23:09] [INFO ] Invariant cache hit.
[2023-03-15 06:23:09] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1316 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 35 out of 209 places after structural reductions.
[2023-03-15 06:23:10] [INFO ] Flatten gal took : 72 ms
[2023-03-15 06:23:10] [INFO ] Flatten gal took : 24 ms
[2023-03-15 06:23:10] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 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 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 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 30 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 36 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-15 06:23:11] [INFO ] Invariant cache hit.
[2023-03-15 06:23:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:11] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-15 06:23:12] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-15 06:23:12] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 8 ms to minimize.
[2023-03-15 06:23:12] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2023-03-15 06:23:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-03-15 06:23:12] [INFO ] After 462ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-15 06:23:12] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-15 06:23:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:12] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-15 06:23:13] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-15 06:23:13] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2023-03-15 06:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-15 06:23:13] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2023-03-15 06:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-15 06:23:13] [INFO ] After 1110ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-15 06:23:14] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 691 ms.
Support contains 22 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 208 transition count 171
Reduce places removed 25 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 35 rules applied. Total rules applied 61 place count 183 transition count 161
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 71 place count 173 transition count 161
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 71 place count 173 transition count 150
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 93 place count 162 transition count 150
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 145 place count 136 transition count 124
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 131 transition count 124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 131 transition count 114
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 175 place count 121 transition count 114
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 191 place count 121 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 120 transition count 113
Applied a total of 192 rules in 76 ms. Remains 120 /209 variables (removed 89) and now considering 113/197 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 120/209 places, 113/197 transitions.
Incomplete random walk after 10000 steps, including 760 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 587 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 604 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 593 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 584 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 581 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 594 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 598 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 594 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 574 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 577 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 590 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 578 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 113 rows 120 cols
[2023-03-15 06:23:17] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-15 06:23:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 06:23:17] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-15 06:23:17] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-15 06:23:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 06:23:17] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-15 06:23:17] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-15 06:23:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:17] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:23:17] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-15 06:23:17] [INFO ] After 119ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-15 06:23:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-15 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-15 06:23:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-15 06:23:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2023-03-15 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2023-03-15 06:23:18] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-15 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 06:23:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2023-03-15 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-15 06:23:18] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-15 06:23:18] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 497 ms.
Support contains 16 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 113/113 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 120 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 119 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 12 place count 114 transition count 107
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 112 transition count 105
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 112 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 111 transition count 104
Applied a total of 19 rules in 36 ms. Remains 111 /120 variables (removed 9) and now considering 104/113 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 111/120 places, 104/113 transitions.
Incomplete random walk after 10000 steps, including 1111 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 772 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 745 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 781 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 776 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 792 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 776 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 771 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 786 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 769 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 763 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 470019 steps, run timeout after 6001 ms. (steps per millisecond=78 ) properties seen :{1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 470019 steps, saw 235117 distinct states, run finished after 6004 ms. (steps per millisecond=78 ) properties seen :8
Running SMT prover for 4 properties.
// Phase 1: matrix 104 rows 111 cols
[2023-03-15 06:23:27] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-15 06:23:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:27] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:23:27] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 06:23:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 06:23:27] [INFO ] After 19ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:27] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:27] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:23:27] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:27] [INFO ] After 47ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-15 06:23:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2023-03-15 06:23:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-15 06:23:27] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 06:23:27] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 88 ms.
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 104/104 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 14 place count 104 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 102 transition count 98
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 102 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 98 transition count 94
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 98 transition count 94
Applied a total of 28 rules in 28 ms. Remains 98 /111 variables (removed 13) and now considering 94/104 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 98/111 places, 94/104 transitions.
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 238087 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238087 steps, saw 119109 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 94 rows 98 cols
[2023-03-15 06:23:31] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-15 06:23:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:31] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:23:31] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 06:23:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 06:23:31] [INFO ] After 18ms SMT Verify possible using 16 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:31] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:31] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:23:31] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:32] [INFO ] After 74ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2023-03-15 06:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 06:23:32] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-15 06:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 06:23:32] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 06:23:32] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 102 ms.
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-15 06:23:32] [INFO ] Invariant cache hit.
[2023-03-15 06:23:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-15 06:23:32] [INFO ] Invariant cache hit.
[2023-03-15 06:23:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 06:23:32] [INFO ] Implicit Places using invariants and state equation in 350 ms returned [21, 28, 65, 70, 89, 95]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 445 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/98 places, 94/94 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 91
Applied a total of 6 rules in 9 ms. Remains 89 /92 variables (removed 3) and now considering 91/94 (removed 3) transitions.
// Phase 1: matrix 91 rows 89 cols
[2023-03-15 06:23:32] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 06:23:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 06:23:32] [INFO ] Invariant cache hit.
[2023-03-15 06:23:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 06:23:33] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 89/98 places, 91/94 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 882 ms. Remains : 89/98 places, 91/94 transitions.
Incomplete random walk after 10000 steps, including 1557 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 262948 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262948 steps, saw 131504 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 06:23:36] [INFO ] Invariant cache hit.
[2023-03-15 06:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:37] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-15 06:23:37] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 06:23:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 06:23:37] [INFO ] After 17ms SMT Verify possible using 16 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:37] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:37] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-15 06:23:37] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:37] [INFO ] After 41ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-15 06:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-15 06:23:37] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 06:23:37] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 89/89 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-15 06:23:37] [INFO ] Invariant cache hit.
[2023-03-15 06:23:37] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-15 06:23:37] [INFO ] Invariant cache hit.
[2023-03-15 06:23:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 06:23:37] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-15 06:23:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 06:23:37] [INFO ] Invariant cache hit.
[2023-03-15 06:23:37] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 89/89 places, 91/91 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 84
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 14 place count 82 transition count 84
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 79 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 79 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 79 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 78 transition count 80
Applied a total of 22 rules in 17 ms. Remains 78 /89 variables (removed 11) and now considering 80/91 (removed 11) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 80 rows 78 cols
[2023-03-15 06:23:37] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-15 06:23:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:38] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-15 06:23:38] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 06:23:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 06:23:38] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:38] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 06:23:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:38] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-15 06:23:38] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:38] [INFO ] After 29ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 06:23:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2023-03-15 06:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 06:23:38] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 06:23:38] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 06:23:38] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-15 06:23:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-15 06:23:38] [INFO ] Invariant cache hit.
[2023-03-15 06:23:39] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-15 06:23:39] [INFO ] Invariant cache hit.
[2023-03-15 06:23:39] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, p0, p0]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s126 1) (GEQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1030 steps with 35 reset in 14 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 1138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(F(!p1)))) U (!p0 U (p2||G(!p0))))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-15 06:23:39] [INFO ] Invariant cache hit.
[2023-03-15 06:23:39] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-15 06:23:39] [INFO ] Invariant cache hit.
[2023-03-15 06:23:40] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-15 06:23:40] [INFO ] Invariant cache hit.
[2023-03-15 06:23:40] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p1]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s81 1) (LT s31 1)), p0:(GEQ s81 1), p1:(AND (GEQ s160 1) (GEQ s167 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 50000 reset in 485 ms.
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 1940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-15 06:23:41] [INFO ] Invariant cache hit.
[2023-03-15 06:23:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-15 06:23:41] [INFO ] Invariant cache hit.
[2023-03-15 06:23:42] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-15 06:23:42] [INFO ] Invariant cache hit.
[2023-03-15 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s173 1), p0:(AND (GEQ s10 1) (GEQ s112 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 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 157 transition count 137
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 27 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2023-03-15 06:23:42] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 06:23:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-15 06:23:42] [INFO ] Invariant cache hit.
[2023-03-15 06:23:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:43] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-15 06:23:43] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 06:23:43] [INFO ] Invariant cache hit.
[2023-03-15 06:23:43] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 494 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s87 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 185 ms.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 322 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/105 stabilizing places and 2/99 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 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 1217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 97 place count 159 transition count 138
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 23 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2023-03-15 06:23:43] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 06:23:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-15 06:23:44] [INFO ] Invariant cache hit.
[2023-03-15 06:23:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:44] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-15 06:23:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 06:23:44] [INFO ] Invariant cache hit.
[2023-03-15 06:23:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 481 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05 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:(AND (LT s52 1) (LT s103 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 13963 reset in 124 ms.
Product exploration explored 100000 steps with 13927 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 8 ms. (steps per millisecond=16 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 9 ms. (steps per millisecond=14 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 06:23:45] [INFO ] Invariant cache hit.
[2023-03-15 06:23:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 06:23:45] [INFO ] Invariant cache hit.
[2023-03-15 06:23:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:45] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-15 06:23:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 06:23:45] [INFO ] Invariant cache hit.
[2023-03-15 06:23:46] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 735 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 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 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3545 steps, including 488 resets, run visited all 1 properties in 12 ms. (steps per millisecond=295 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13891 reset in 130 ms.
Product exploration explored 100000 steps with 13888 reset in 144 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 06:23:47] [INFO ] Invariant cache hit.
[2023-03-15 06:23:47] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 06:23:47] [INFO ] Invariant cache hit.
[2023-03-15 06:23:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:47] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-15 06:23:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 06:23:47] [INFO ] Invariant cache hit.
[2023-03-15 06:23:47] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 105/105 places, 99/99 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 3689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 06:23:47] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:23:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-15 06:23:47] [INFO ] Invariant cache hit.
[2023-03-15 06:23:48] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-15 06:23:48] [INFO ] Invariant cache hit.
[2023-03-15 06:23:48] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s178 1) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-06 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 161 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
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 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 24 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2023-03-15 06:23:48] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:23:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-15 06:23:48] [INFO ] Invariant cache hit.
[2023-03-15 06:23:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-15 06:23:48] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-15 06:23:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 06:23:48] [INFO ] Invariant cache hit.
[2023-03-15 06:23:48] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 476 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s36 1), p1:(AND (GEQ s88 1) (GEQ s98 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 13894 reset in 182 ms.
Product exploration explored 100000 steps with 13885 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 26 ms. (steps per millisecond=212 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 26 ms. (steps per millisecond=212 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-15 06:23:50] [INFO ] Invariant cache hit.
[2023-03-15 06:23:50] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-15 06:23:50] [INFO ] Invariant cache hit.
[2023-03-15 06:23:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-15 06:23:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-15 06:23:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 06:23:50] [INFO ] Invariant cache hit.
[2023-03-15 06:23:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 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 : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1367 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 24 ms. (steps per millisecond=230 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 24 ms. (steps per millisecond=230 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13810 reset in 117 ms.
Product exploration explored 100000 steps with 13907 reset in 137 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-15 06:23:51] [INFO ] Invariant cache hit.
[2023-03-15 06:23:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 06:23:51] [INFO ] Invariant cache hit.
[2023-03-15 06:23:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-15 06:23:51] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-15 06:23:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:51] [INFO ] Invariant cache hit.
[2023-03-15 06:23:51] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 106/106 places, 100/100 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 3539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 157 transition count 138
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 16 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2023-03-15 06:23:51] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:23:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-15 06:23:52] [INFO ] Invariant cache hit.
[2023-03-15 06:23:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:52] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-15 06:23:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:52] [INFO ] Invariant cache hit.
[2023-03-15 06:23:52] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08 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 s19 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 13851 reset in 116 ms.
Product exploration explored 100000 steps with 13959 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 13 ms. (steps per millisecond=243 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 13 ms. (steps per millisecond=243 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 06:23:53] [INFO ] Invariant cache hit.
[2023-03-15 06:23:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-15 06:23:53] [INFO ] Invariant cache hit.
[2023-03-15 06:23:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:53] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-15 06:23:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:53] [INFO ] Invariant cache hit.
[2023-03-15 06:23:53] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 106/106 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 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 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1393 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 13 ms. (steps per millisecond=243 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 13 ms. (steps per millisecond=243 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13886 reset in 118 ms.
Product exploration explored 100000 steps with 13826 reset in 131 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 06:23:54] [INFO ] Invariant cache hit.
[2023-03-15 06:23:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 06:23:54] [INFO ] Invariant cache hit.
[2023-03-15 06:23:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:54] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-15 06:23:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:54] [INFO ] Invariant cache hit.
[2023-03-15 06:23:54] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 106/106 places, 99/99 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 2834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&X(F(p2))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 06:23:54] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-15 06:23:54] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 06:23:54] [INFO ] Invariant cache hit.
[2023-03-15 06:23:55] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-15 06:23:55] [INFO ] Invariant cache hit.
[2023-03-15 06:23:55] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s59 1) (GEQ s161 1)), p1:(LT s148 1), p2:(AND (LT s148 1) (OR (LT s59 1) (LT s161 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1452 steps with 88 reset in 2 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p2)||p1)&&p0))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 163 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 161 transition count 149
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 93 place count 161 transition count 141
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 109 place count 153 transition count 141
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 185 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 110 transition count 103
Applied a total of 195 rules in 16 ms. Remains 110 /209 variables (removed 99) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 110 cols
[2023-03-15 06:23:55] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 06:23:55] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 06:23:55] [INFO ] Invariant cache hit.
[2023-03-15 06:23:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:56] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-15 06:23:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 06:23:56] [INFO ] Invariant cache hit.
[2023-03-15 06:23:56] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/209 places, 103/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 505 ms. Remains : 110/209 places, 103/197 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s109 1)), p0:(AND (GEQ s65 1) (OR (LT s0 1) (LT s38 1))), p2:(OR (LT s0 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 159 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 193 place count 111 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
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 205 place count 105 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 104 transition count 98
Applied a total of 206 rules in 19 ms. Remains 104 /209 variables (removed 105) and now considering 98/197 (removed 99) transitions.
// Phase 1: matrix 98 rows 104 cols
[2023-03-15 06:23:56] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-15 06:23:56] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-15 06:23:56] [INFO ] Invariant cache hit.
[2023-03-15 06:23:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:23:56] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-15 06:23:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:56] [INFO ] Invariant cache hit.
[2023-03-15 06:23:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/209 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 104/209 places, 98/197 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 208 transition count 146
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 150 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 189 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 108 transition count 102
Applied a total of 201 rules in 12 ms. Remains 108 /209 variables (removed 101) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 108 cols
[2023-03-15 06:23:56] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:23:56] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-15 06:23:56] [INFO ] Invariant cache hit.
[2023-03-15 06:23:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 06:23:57] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-15 06:23:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:57] [INFO ] Invariant cache hit.
[2023-03-15 06:23:57] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 108/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) 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=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s17 1) (LT s54 1)), p0:(LT s17 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8808 reset in 115 ms.
Product exploration explored 100000 steps with 8836 reset in 131 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/108 stabilizing places and 1/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 879 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 609 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 06:23:58] [INFO ] Invariant cache hit.
[2023-03-15 06:23:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 06:23:58] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:23:58] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 06:23:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 06:23:58] [INFO ] After 46ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 06:23:58] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 06:23:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:23:58] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:23:58] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 06:23:58] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 06:23:58] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 06:23:58] [INFO ] After 157ms 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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
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 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 13 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1306 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 9 ms. (steps per millisecond=216 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 10 ms. (steps per millisecond=194 ) properties seen :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 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 : 108/108 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-15 06:23:59] [INFO ] Invariant cache hit.
[2023-03-15 06:23:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 06:23:59] [INFO ] Invariant cache hit.
[2023-03-15 06:23:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 06:23:59] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-15 06:23:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:23:59] [INFO ] Invariant cache hit.
[2023-03-15 06:23:59] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 108/108 places, 102/102 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 888 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 586 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 06:24:00] [INFO ] Invariant cache hit.
[2023-03-15 06:24:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:00] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:00] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 06:24:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 06:24:00] [INFO ] After 47ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 06:24:00] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 06:24:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:00] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:00] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 06:24:00] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 06:24:00] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 06:24:00] [INFO ] After 168ms 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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
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 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 15 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 9 ms. (steps per millisecond=216 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 10 ms. (steps per millisecond=194 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8873 reset in 107 ms.
Product exploration explored 100000 steps with 8806 reset in 119 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /108 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 107 cols
[2023-03-15 06:24:01] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 06:24:01] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-15 06:24:01] [INFO ] Invariant cache hit.
[2023-03-15 06:24:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:01] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-15 06:24:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:24:01] [INFO ] Invariant cache hit.
[2023-03-15 06:24:01] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 107/108 places, 101/102 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 5154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&G((p2&&F(p3)))))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 161 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 185 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 195 place count 110 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 109 transition count 102
Applied a total of 197 rules in 15 ms. Remains 109 /209 variables (removed 100) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 109 cols
[2023-03-15 06:24:01] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 06:24:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 06:24:01] [INFO ] Invariant cache hit.
[2023-03-15 06:24:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:02] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-15 06:24:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 06:24:02] [INFO ] Invariant cache hit.
[2023-03-15 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 109/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s55 1), p0:(AND (GEQ s38 1) (GEQ s106 1)), p3:(LT s67 1), p1:(OR (LT s52 1) (LT s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 11377 reset in 140 ms.
Product exploration explored 100000 steps with 11382 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 109 vertex of which 108 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 : [(AND p2 (NOT p0) p3 p1), (X p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 522 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 974 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 646 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 651 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 655 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 06:24:03] [INFO ] Invariant cache hit.
[2023-03-15 06:24:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:03] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:03] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 06:24:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:03] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:04] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 06:24:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:04] [INFO ] After 44ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 06:24:04] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 06:24:04] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 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 107 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 100
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 106 transition count 91
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 24 place count 97 transition count 91
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 97 transition count 91
Applied a total of 39 rules in 10 ms. Remains 97 /109 variables (removed 12) and now considering 91/102 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 97/109 places, 91/102 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 393935 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{0=1}
Probabilistic random walk after 393935 steps, saw 197084 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 97 cols
[2023-03-15 06:24:07] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:24:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:07] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:07] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:07] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:08] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:08] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:08] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 06:24:08] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 406122 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406122 steps, saw 203184 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 06:24:11] [INFO ] Invariant cache hit.
[2023-03-15 06:24:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:11] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:11] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:11] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:11] [INFO ] After 32ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:11] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 06:24:11] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-15 06:24:11] [INFO ] Invariant cache hit.
[2023-03-15 06:24:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-15 06:24:11] [INFO ] Invariant cache hit.
[2023-03-15 06:24:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned [22, 28, 64, 69, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 424 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/97 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 90
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 91 transition count 90
Applied a total of 5 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 91 cols
[2023-03-15 06:24:12] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 06:24:12] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-15 06:24:12] [INFO ] Invariant cache hit.
[2023-03-15 06:24:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:12] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/97 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 797 ms. Remains : 91/97 places, 90/91 transitions.
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 330298 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330298 steps, saw 165181 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 06:24:15] [INFO ] Invariant cache hit.
[2023-03-15 06:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 06:24:15] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:15] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 06:24:15] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:15] [INFO ] After 28ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:16] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 06:24:16] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-15 06:24:16] [INFO ] Invariant cache hit.
[2023-03-15 06:24:16] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 06:24:16] [INFO ] Invariant cache hit.
[2023-03-15 06:24:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:16] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-15 06:24:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 06:24:16] [INFO ] Invariant cache hit.
[2023-03-15 06:24:16] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 91/91 places, 90/90 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 83
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 82 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 82 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 81 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 79
Applied a total of 22 rules in 11 ms. Remains 80 /91 variables (removed 11) and now considering 79/90 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 79 rows 80 cols
[2023-03-15 06:24:16] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 06:24:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 06:24:16] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 06:24:16] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 06:24:16] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:16] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 06:24:16] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p0) p3 p1), (X p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 578 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 109 cols
[2023-03-15 06:24:17] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:24:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-15 06:24:17] [INFO ] Invariant cache hit.
[2023-03-15 06:24:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:18] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-15 06:24:18] [INFO ] Invariant cache hit.
[2023-03-15 06:24:18] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 109/109 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 109 vertex of which 108 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 : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 964 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 655 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 649 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 635 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 06:24:19] [INFO ] Invariant cache hit.
[2023-03-15 06:24:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:19] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-15 06:24:19] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 06:24:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:19] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-15 06:24:19] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 06:24:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:19] [INFO ] After 45ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 06:24:19] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 06:24:19] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 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 107 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 100
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 106 transition count 91
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 24 place count 97 transition count 91
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 97 transition count 91
Applied a total of 39 rules in 11 ms. Remains 97 /109 variables (removed 12) and now considering 91/102 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 97/109 places, 91/102 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 400770 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{0=1}
Probabilistic random walk after 400770 steps, saw 200502 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 97 cols
[2023-03-15 06:24:23] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-15 06:24:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:23] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:23] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:23] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:23] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:23] [INFO ] After 25ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:23] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-15 06:24:23] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 796 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 409870 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409870 steps, saw 205053 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 06:24:26] [INFO ] Invariant cache hit.
[2023-03-15 06:24:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 06:24:26] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 06:24:26] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:26] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 06:24:26] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:26] [INFO ] After 31ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:26] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 06:24:26] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-15 06:24:26] [INFO ] Invariant cache hit.
[2023-03-15 06:24:26] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-15 06:24:26] [INFO ] Invariant cache hit.
[2023-03-15 06:24:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:27] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [22, 28, 64, 69, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 392 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/97 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 90
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 91 transition count 90
Applied a total of 5 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 91 cols
[2023-03-15 06:24:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 06:24:27] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-15 06:24:27] [INFO ] Invariant cache hit.
[2023-03-15 06:24:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:27] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/97 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 788 ms. Remains : 91/97 places, 90/91 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 472792 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472792 steps, saw 236447 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 06:24:30] [INFO ] Invariant cache hit.
[2023-03-15 06:24:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:30] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 06:24:30] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:30] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 06:24:31] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:31] [INFO ] After 25ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:31] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 06:24:31] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-15 06:24:31] [INFO ] Invariant cache hit.
[2023-03-15 06:24:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-15 06:24:31] [INFO ] Invariant cache hit.
[2023-03-15 06:24:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-15 06:24:31] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-15 06:24:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 06:24:31] [INFO ] Invariant cache hit.
[2023-03-15 06:24:31] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 91/91 places, 90/90 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 83
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 82 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 82 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 81 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 79
Applied a total of 22 rules in 6 ms. Remains 80 /91 variables (removed 11) and now considering 79/90 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 79 rows 80 cols
[2023-03-15 06:24:31] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 06:24:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:31] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 06:24:31] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 06:24:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 06:24:31] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 06:24:31] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 06:24:31] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 06:24:31] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 06:24:31] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 11431 reset in 132 ms.
Product exploration explored 100000 steps with 11387 reset in 146 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-15 06:24:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 109 cols
[2023-03-15 06:24:33] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 06:24:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 109/109 places, 102/102 transitions.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-15 06:24:33] [INFO ] Invariant cache hit.
[2023-03-15 06:24:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-15 06:24:33] [INFO ] Invariant cache hit.
[2023-03-15 06:24:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 06:24:34] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-15 06:24:34] [INFO ] Invariant cache hit.
[2023-03-15 06:24:34] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 109/109 places, 102/102 transitions.
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 32373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&G((p2&&F(p3)))))'
[2023-03-15 06:24:34] [INFO ] Flatten gal took : 17 ms
[2023-03-15 06:24:34] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 06:24:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 197 transitions and 546 arcs took 3 ms.
Total runtime 86701 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1992/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1992/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1992/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1992/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1992/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-004-LTLFireability-05
Could not compute solution for formula : DoubleExponent-PT-004-LTLFireability-07
Could not compute solution for formula : DoubleExponent-PT-004-LTLFireability-08
Could not compute solution for formula : DoubleExponent-PT-004-LTLFireability-14
Could not compute solution for formula : DoubleExponent-PT-004-LTLFireability-15

BK_STOP 1678861476389

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DoubleExponent-PT-004-LTLFireability-05
ltl formula formula --ltl=/tmp/1992/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 209 places, 197 transitions and 546 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1992/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1992/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1992/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1992/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-004-LTLFireability-07
ltl formula formula --ltl=/tmp/1992/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 209 places, 197 transitions and 546 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1992/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1992/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1992/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1992/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-004-LTLFireability-08
ltl formula formula --ltl=/tmp/1992/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 209 places, 197 transitions and 546 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1992/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1992/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1992/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1992/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-004-LTLFireability-14
ltl formula formula --ltl=/tmp/1992/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 209 places, 197 transitions and 546 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1992/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1992/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1992/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1992/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DoubleExponent-PT-004-LTLFireability-15
ltl formula formula --ltl=/tmp/1992/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 209 places, 197 transitions and 546 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1992/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1992/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1992/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1992/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-004, 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 r137-smll-167819418500468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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