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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 50K 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-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678858273828

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-003
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:31:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 05:31:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:31:16] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-15 05:31:16] [INFO ] Transformed 163 places.
[2023-03-15 05:31:16] [INFO ] Transformed 148 transitions.
[2023-03-15 05:31:16] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 31 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2023-03-15 05:31:16] [INFO ] Computed 16 place invariants in 18 ms
[2023-03-15 05:31:17] [INFO ] Implicit Places using invariants in 460 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 506 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 24 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-15 05:31:17] [INFO ] Computed 14 place invariants in 14 ms
[2023-03-15 05:31:17] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 05:31:17] [INFO ] Invariant cache hit.
[2023-03-15 05:31:17] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/163 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 980 ms. Remains : 156/163 places, 147/148 transitions.
Support contains 38 out of 156 places after structural reductions.
[2023-03-15 05:31:17] [INFO ] Flatten gal took : 52 ms
[2023-03-15 05:31:17] [INFO ] Flatten gal took : 22 ms
[2023-03-15 05:31:18] [INFO ] Input system was already deterministic with 147 transitions.
Support contains 36 out of 156 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-15 05:31:19] [INFO ] Invariant cache hit.
[2023-03-15 05:31:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:19] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 9 ms returned sat
[2023-03-15 05:31:19] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2023-03-15 05:31:19] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 6 ms to minimize.
[2023-03-15 05:31:19] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-15 05:31:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2023-03-15 05:31:19] [INFO ] After 431ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-15 05:31:19] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-15 05:31:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:19] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-15 05:31:20] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-15 05:31:20] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:31:20] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2023-03-15 05:31:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-15 05:31:20] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-15 05:31:20] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-15 05:31:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-15 05:31:20] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-15 05:31:21] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 240 ms.
Support contains 22 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 155 transition count 125
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 48 place count 134 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 129 transition count 120
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 53 place count 129 transition count 111
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 120 transition count 111
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 109 place count 101 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 97 transition count 92
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 97 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 92 transition count 87
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 135 place count 92 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 91 transition count 86
Applied a total of 136 rules in 51 ms. Remains 91 /156 variables (removed 65) and now considering 86/147 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 91/156 places, 86/147 transitions.
Incomplete random walk after 10000 steps, including 1047 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 728 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 759 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 712 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 739 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 753 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 731 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 749 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 735 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 726 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 746 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 86 rows 91 cols
[2023-03-15 05:31:23] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 05:31:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:23] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:23] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-15 05:31:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:23] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 05:31:23] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 05:31:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:24] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:24] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-15 05:31:24] [INFO ] After 75ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-15 05:31:24] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-15 05:31:24] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 86/86 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 88 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 87 transition count 82
Applied a total of 10 rules in 16 ms. Remains 87 /91 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/91 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Finished probabilistic random walk after 115957 steps, run visited all 11 properties in 1336 ms. (steps per millisecond=86 )
Probabilistic random walk after 115957 steps, saw 58014 distinct states, run finished after 1340 ms. (steps per millisecond=86 ) properties seen :11
FORMULA DoubleExponent-PT-003-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.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' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 75 place count 117 transition count 102
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 87 place count 111 transition count 102
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 143 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 151 place count 79 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 78 transition count 73
Applied a total of 153 rules in 26 ms. Remains 78 /156 variables (removed 78) and now considering 73/147 (removed 74) transitions.
// Phase 1: matrix 73 rows 78 cols
[2023-03-15 05:31:28] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 05:31:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-15 05:31:28] [INFO ] Invariant cache hit.
[2023-03-15 05:31:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:28] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-15 05:31:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:28] [INFO ] Invariant cache hit.
[2023-03-15 05:31:28] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/156 places, 73/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 78/156 places, 73/147 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s74 1)), p0:(GEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13911 reset in 300 ms.
Product exploration explored 100000 steps with 13874 reset in 266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 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 1385 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 796 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:31:29] [INFO ] Invariant cache hit.
[2023-03-15 05:31:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:29] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:30] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:31:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:30] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 05:31:30] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:31:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:30] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:31:30] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-15 05:31:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:31:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-15 05:31:30] [INFO ] After 92ms 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 05:31:30] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 73/73 transitions.
Graph (complete) has 216 edges and 78 vertex of which 77 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 77 transition count 72
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 77 transition count 64
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 69 transition count 64
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 69 transition count 64
Applied a total of 30 rules in 12 ms. Remains 69 /78 variables (removed 9) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 69/78 places, 64/73 transitions.
Incomplete random walk after 10000 steps, including 1272 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 849 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2004 steps, run visited all 1 properties in 9 ms. (steps per millisecond=222 )
Probabilistic random walk after 2004 steps, saw 1032 distinct states, run finished after 10 ms. (steps per millisecond=200 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-15 05:31:30] [INFO ] Invariant cache hit.
[2023-03-15 05:31:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 05:31:30] [INFO ] Invariant cache hit.
[2023-03-15 05:31:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:30] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-15 05:31:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:30] [INFO ] Invariant cache hit.
[2023-03-15 05:31:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 398 ms. Remains : 78/78 places, 73/73 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 807 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3378 steps, run visited all 2 properties in 14 ms. (steps per millisecond=241 )
Probabilistic random walk after 3378 steps, saw 1715 distinct states, run finished after 14 ms. (steps per millisecond=241 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13958 reset in 124 ms.
Product exploration explored 100000 steps with 13877 reset in 142 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-15 05:31:32] [INFO ] Invariant cache hit.
[2023-03-15 05:31:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-15 05:31:32] [INFO ] Invariant cache hit.
[2023-03-15 05:31:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-15 05:31:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:32] [INFO ] Invariant cache hit.
[2023-03-15 05:31:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 78/78 places, 73/73 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 4448 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))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 154 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 120 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 119 transition count 103
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 112 transition count 103
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 137 place count 86 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 82 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 81 transition count 76
Applied a total of 146 rules in 23 ms. Remains 81 /156 variables (removed 75) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 81 cols
[2023-03-15 05:31:32] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 05:31:32] [INFO ] Invariant cache hit.
[2023-03-15 05:31:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:33] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-15 05:31:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:33] [INFO ] Invariant cache hit.
[2023-03-15 05:31:33] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/156 places, 76/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 81/156 places, 76/147 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LT s44 1), p0:(AND (GEQ s6 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-01 finished in 506 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 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 154 transition count 113
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 122 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 119 transition count 104
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 83 place count 113 transition count 104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 137 place count 86 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 83 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 82 transition count 76
Applied a total of 145 rules in 25 ms. Remains 82 /156 variables (removed 74) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 82 cols
[2023-03-15 05:31:33] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 05:31:33] [INFO ] Invariant cache hit.
[2023-03-15 05:31:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:33] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-15 05:31:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 05:31:33] [INFO ] Invariant cache hit.
[2023-03-15 05:31:33] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/156 places, 76/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 82/156 places, 76/147 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s21 1) (AND (GEQ s47 1) (GEQ s74 1)) (AND (GEQ s3 1) (GEQ s43 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 10 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-02 finished in 395 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 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 75 place count 117 transition count 101
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 89 place count 110 transition count 101
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 145 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 77 transition count 72
Applied a total of 154 rules in 23 ms. Remains 77 /156 variables (removed 79) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 77 cols
[2023-03-15 05:31:33] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-15 05:31:33] [INFO ] Invariant cache hit.
[2023-03-15 05:31:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:33] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-15 05:31:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 05:31:33] [INFO ] Invariant cache hit.
[2023-03-15 05:31:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/156 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 77/156 places, 72/147 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-03 finished in 403 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(p1)&&p0)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 154 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 118 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 73 place count 118 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 112 transition count 103
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 141 place count 84 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 80 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 79 transition count 74
Applied a total of 150 rules in 18 ms. Remains 79 /156 variables (removed 77) and now considering 74/147 (removed 73) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-15 05:31:34] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 05:31:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-15 05:31:34] [INFO ] Invariant cache hit.
[2023-03-15 05:31:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:34] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-15 05:31:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:34] [INFO ] Invariant cache hit.
[2023-03-15 05:31:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/156 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 79/156 places, 74/147 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s39 1)), p1:(OR (AND (GEQ s35 1) (GEQ s39 1)) (GEQ s15 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 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-04 finished in 433 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)&&F(p1))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 154 transition count 109
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 118 transition count 109
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 73 place count 118 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 111 transition count 102
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 141 place count 84 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 149 place count 80 transition count 75
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 80 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 79 transition count 74
Applied a total of 151 rules in 19 ms. Remains 79 /156 variables (removed 77) and now considering 74/147 (removed 73) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-15 05:31:34] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 05:31:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 05:31:34] [INFO ] Invariant cache hit.
[2023-03-15 05:31:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:34] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-15 05:31:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:34] [INFO ] Invariant cache hit.
[2023-03-15 05:31:34] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/156 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 79/156 places, 74/147 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s24 1)), p1:(AND (GEQ s40 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-05 finished in 452 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((G(p0)||(!p1&&X(p2))))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-15 05:31:34] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-15 05:31:35] [INFO ] Invariant cache hit.
[2023-03-15 05:31:35] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-15 05:31:35] [INFO ] Invariant cache hit.
[2023-03-15 05:31:35] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s81 1)), p1:(AND (GEQ s13 1) (GEQ s49 1)), p2:(OR (LT s110 1) (LT s136 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 3354 reset in 181 ms.
Product exploration explored 100000 steps with 3311 reset in 223 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 765 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 331 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-15 05:31:38] [INFO ] Invariant cache hit.
[2023-03-15 05:31:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:38] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:31:38] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-15 05:31:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:38] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:31:38] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-15 05:31:39] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2023-03-15 05:31:39] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2023-03-15 05:31:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-15 05:31:39] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-15 05:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-15 05:31:39] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 05:31:39] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 154 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 118 transition count 109
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 74 place count 118 transition count 101
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 90 place count 110 transition count 101
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 144 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 79 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 79 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 70 transition count 65
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 181 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 69 transition count 64
Applied a total of 182 rules in 20 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 69 cols
[2023-03-15 05:31:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 05:31:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:39] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-15 05:31:39] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:31:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:39] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-15 05:31:39] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:31:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:31:39] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:31:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-15 05:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 05:31:39] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-15 05:31:39] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 118868 steps, run visited all 1 properties in 312 ms. (steps per millisecond=380 )
Probabilistic random walk after 118868 steps, saw 59464 distinct states, run finished after 313 ms. (steps per millisecond=379 ) properties seen :1
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 21 factoid took 665 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-06 finished in 5637 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 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 75 place count 117 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 110 transition count 101
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 147 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 76 transition count 71
Applied a total of 156 rules in 14 ms. Remains 76 /156 variables (removed 80) and now considering 71/147 (removed 76) transitions.
// Phase 1: matrix 71 rows 76 cols
[2023-03-15 05:31:40] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 05:31:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 05:31:40] [INFO ] Invariant cache hit.
[2023-03-15 05:31:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-15 05:31:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:40] [INFO ] Invariant cache hit.
[2023-03-15 05:31:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/156 places, 71/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 76/156 places, 71/147 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s43 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 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 359 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((G(p2)||p1))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-15 05:31:40] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-15 05:31:41] [INFO ] Invariant cache hit.
[2023-03-15 05:31:41] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-15 05:31:41] [INFO ] Invariant cache hit.
[2023-03-15 05:31:41] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s12 1) (LT s82 1)), p2:(LT s5 1), p1:(OR (LT s38 1) (LT s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p2)))
Knowledge based reduction with 14 factoid took 253 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 1699 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)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-15 05:31:42] [INFO ] Invariant cache hit.
[2023-03-15 05:31:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-15 05:31:42] [INFO ] Invariant cache hit.
[2023-03-15 05:31:42] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-15 05:31:42] [INFO ] Invariant cache hit.
[2023-03-15 05:31:43] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6250 reset in 97 ms.
Product exploration explored 100000 steps with 6250 reset in 245 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-15 05:31:43] [INFO ] Invariant cache hit.
[2023-03-15 05:31:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:44] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-15 05:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:44] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-15 05:31:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:31:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:44] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 11 ms returned sat
[2023-03-15 05:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2023-03-15 05:31:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 402 ms
[2023-03-15 05:31:44] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 05:31:45] [INFO ] Added : 74 causal constraints over 15 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 154 transition count 107
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 116 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 116 transition count 102
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 111 transition count 102
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 145 place count 82 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 79 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 78 transition count 72
Applied a total of 152 rules in 12 ms. Remains 78 /156 variables (removed 78) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 78 cols
[2023-03-15 05:31:45] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-15 05:31:45] [INFO ] Invariant cache hit.
[2023-03-15 05:31:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:45] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-15 05:31:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:45] [INFO ] Invariant cache hit.
[2023-03-15 05:31:45] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/156 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 78/156 places, 72/147 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-15 05:31:45] [INFO ] Invariant cache hit.
[2023-03-15 05:31:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:46] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 05:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:46] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-15 05:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:31:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:46] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:46] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 05:31:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2023-03-15 05:31:46] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-15 05:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 05:31:46] [INFO ] Computed and/alt/rep : 71/215/71 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:31:46] [INFO ] Added : 22 causal constraints over 5 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-15 05:31:46] [INFO ] Invariant cache hit.
[2023-03-15 05:31:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 05:31:46] [INFO ] Invariant cache hit.
[2023-03-15 05:31:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-15 05:31:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:46] [INFO ] Invariant cache hit.
[2023-03-15 05:31:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 78/78 places, 72/72 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-12 finished in 4404 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)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 154 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 121 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 120 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 120 transition count 105
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 114 transition count 105
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 139 place count 85 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 81 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 80 transition count 75
Applied a total of 148 rules in 18 ms. Remains 80 /156 variables (removed 76) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 80 cols
[2023-03-15 05:31:47] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-15 05:31:47] [INFO ] Invariant cache hit.
[2023-03-15 05:31:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:47] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-15 05:31:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:47] [INFO ] Invariant cache hit.
[2023-03-15 05:31:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/156 places, 75/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 80/156 places, 75/147 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s12 1)), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13793 reset in 128 ms.
Product exploration explored 100000 steps with 13990 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 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 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 793 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 794 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3198 steps, run visited all 3 properties in 32 ms. (steps per millisecond=99 )
Probabilistic random walk after 3198 steps, saw 1625 distinct states, run finished after 37 ms. (steps per millisecond=86 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 307 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 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-15 05:31:48] [INFO ] Invariant cache hit.
[2023-03-15 05:31:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 05:31:49] [INFO ] Invariant cache hit.
[2023-03-15 05:31:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:49] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-15 05:31:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:49] [INFO ] Invariant cache hit.
[2023-03-15 05:31:49] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 80/80 places, 75/75 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 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 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3198 steps, run visited all 3 properties in 45 ms. (steps per millisecond=71 )
Probabilistic random walk after 3198 steps, saw 1625 distinct states, run finished after 45 ms. (steps per millisecond=71 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 315 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 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13866 reset in 128 ms.
Product exploration explored 100000 steps with 13901 reset in 149 ms.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-15 05:31:51] [INFO ] Invariant cache hit.
[2023-03-15 05:31:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 05:31:51] [INFO ] Invariant cache hit.
[2023-03-15 05:31:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:51] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-15 05:31:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:31:51] [INFO ] Invariant cache hit.
[2023-03-15 05:31:51] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 80/80 places, 75/75 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-13 finished in 4435 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(X(F(p0))))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-15 05:31:51] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 05:31:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-15 05:31:51] [INFO ] Invariant cache hit.
[2023-03-15 05:31:51] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-15 05:31:51] [INFO ] Invariant cache hit.
[2023-03-15 05:31:51] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s37 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 38 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 576 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(X((F(p0)&&G(p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-15 05:31:52] [INFO ] Invariant cache hit.
[2023-03-15 05:31:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-15 05:31:52] [INFO ] Invariant cache hit.
[2023-03-15 05:31:52] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-15 05:31:52] [INFO ] Invariant cache hit.
[2023-03-15 05:31:52] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s71 1), p0:(OR (LT s61 1) (LT s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 617 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(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' '!(X(F(p0)))'
Found a Shortening insensitive property : DoubleExponent-PT-003-LTLFireability-12
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 154 transition count 107
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 116 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 116 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 111 transition count 102
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 145 place count 82 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 79 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 78 transition count 72
Applied a total of 152 rules in 11 ms. Remains 78 /156 variables (removed 78) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 78 cols
[2023-03-15 05:31:53] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:31:53] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-15 05:31:53] [INFO ] Invariant cache hit.
[2023-03-15 05:31:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-15 05:31:53] [INFO ] Invariant cache hit.
[2023-03-15 05:31:53] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 78/156 places, 72/147 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 301 ms. Remains : 78/156 places, 72/147 transitions.
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-15 05:31:53] [INFO ] Invariant cache hit.
[2023-03-15 05:31:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:54] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:54] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-15 05:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:31:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:31:54] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 05:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-15 05:31:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2023-03-15 05:31:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-15 05:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 05:31:54] [INFO ] Computed and/alt/rep : 71/215/71 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 05:31:54] [INFO ] Added : 22 causal constraints over 5 iterations in 73 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-15 05:31:54] [INFO ] Invariant cache hit.
[2023-03-15 05:31:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 05:31:54] [INFO ] Invariant cache hit.
[2023-03-15 05:31:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-15 05:31:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:31:54] [INFO ] Invariant cache hit.
[2023-03-15 05:31:54] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 78/78 places, 72/72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-15 05:31:54] [INFO ] Invariant cache hit.
[2023-03-15 05:31:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:55] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-15 05:31:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:31:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:31:55] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:31:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-15 05:31:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2023-03-15 05:31:55] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-15 05:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-15 05:31:55] [INFO ] Computed and/alt/rep : 71/215/71 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 05:31:55] [INFO ] Added : 22 causal constraints over 5 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-15 05:31:55] [INFO ] Invariant cache hit.
[2023-03-15 05:31:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-15 05:31:55] [INFO ] Invariant cache hit.
[2023-03-15 05:31:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:31:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-15 05:31:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:31:55] [INFO ] Invariant cache hit.
[2023-03-15 05:31:55] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 78/78 places, 72/72 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-12 finished in 3105 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)))'
[2023-03-15 05:31:56] [INFO ] Flatten gal took : 14 ms
[2023-03-15 05:31:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 05:31:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 147 transitions and 405 arcs took 2 ms.
Total runtime 39835 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1649/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1649/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1649/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-003-LTLFireability-00
Could not compute solution for formula : DoubleExponent-PT-003-LTLFireability-12
Could not compute solution for formula : DoubleExponent-PT-003-LTLFireability-13

BK_STOP 1678858317485

--------------------
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-003-LTLFireability-00
ltl formula formula --ltl=/tmp/1649/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 156 places, 147 transitions and 405 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DoubleExponent-PT-003-LTLFireability-12
ltl formula formula --ltl=/tmp/1649/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
pnml2lts-mc( 0/ 4): Petri net has 156 places, 147 transitions and 405 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1649/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1649/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1649/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1649/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-003-LTLFireability-13
ltl formula formula --ltl=/tmp/1649/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: =============================================================================
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 156 places, 147 transitions and 405 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.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1649/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1649/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1649/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1649/ltl_2_
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)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418500460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;