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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 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:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 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 33K 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-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678856489404

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-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 05:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:01:32] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-15 05:01:32] [INFO ] Transformed 110 places.
[2023-03-15 05:01:32] [INFO ] Transformed 98 transitions.
[2023-03-15 05:01:32] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 23 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:32] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-15 05:01:32] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-15 05:01:32] [INFO ] Invariant cache hit.
[2023-03-15 05:01:32] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-15 05:01:32] [INFO ] Invariant cache hit.
[2023-03-15 05:01:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 33 out of 106 places after structural reductions.
[2023-03-15 05:01:33] [INFO ] Flatten gal took : 42 ms
[2023-03-15 05:01:33] [INFO ] Flatten gal took : 17 ms
[2023-03-15 05:01:33] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-15 05:01:34] [INFO ] Invariant cache hit.
[2023-03-15 05:01:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:01:35] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 05:01:35] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :1 sat :5 real:12
[2023-03-15 05:01:35] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 7 ms to minimize.
[2023-03-15 05:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-15 05:01:35] [INFO ] After 325ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-15 05:01:35] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-15 05:01:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:01:35] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 05:01:35] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-15 05:01:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-15 05:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-15 05:01:36] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-15 05:01:36] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 19 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 91
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 99 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 95 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 95 transition count 83
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 91 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 56 place count 78 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 77 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 77 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 76 transition count 69
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 66 place count 76 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 72 place count 70 transition count 63
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 79 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 69 transition count 62
Applied a total of 80 rules in 64 ms. Remains 69 /106 variables (removed 37) and now considering 62/98 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 69/106 places, 62/98 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10000 steps, including 528 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 530 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 541 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 62 rows 69 cols
[2023-03-15 05:01:38] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-15 05:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:01:38] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:01:38] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-15 05:01:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:01:38] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 05:01:38] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 05:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:01:38] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 05:01:38] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 05:01:38] [INFO ] After 39ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 05:01:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2023-03-15 05:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-15 05:01:38] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 05:01:38] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 41 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 62/62 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 58 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 57 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 57 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 54 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 53 transition count 48
Applied a total of 33 rules in 24 ms. Remains 53 /69 variables (removed 16) and now considering 48/62 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 53/69 places, 48/62 transitions.
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Finished probabilistic random walk after 2010 steps, run visited all 6 properties in 30 ms. (steps per millisecond=67 )
Probabilistic random walk after 2010 steps, saw 1033 distinct states, run finished after 31 ms. (steps per millisecond=64 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
FORMULA DoubleExponent-PT-002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&(!p1 U !p0)&&X(p2))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:40] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 05:01:40] [INFO ] Implicit Places using invariants in 101 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 105/106 places, 98/98 transitions.
Stuttering acceptance computed with spot in 333 ms :[true, (OR (NOT p2) p0), p0]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p0 p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s90 1), p1:(OR (AND (GEQ s75 1) (GEQ s93 1)) (GEQ s90 1)), p2:(AND (GEQ s42 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!((G(!G(p0))&&X(X(!p0))) U !p1))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 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 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 84 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 83 transition count 71
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 58 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 57 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 56 transition count 50
Applied a total of 99 rules in 28 ms. Remains 56 /106 variables (removed 50) and now considering 50/98 (removed 48) transitions.
// Phase 1: matrix 50 rows 56 cols
[2023-03-15 05:01:40] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 05:01:40] [INFO ] Implicit Places using invariants in 88 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/106 places, 50/98 transitions.
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 50 transition count 46
Applied a total of 7 rules in 7 ms. Remains 50 /54 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-15 05:01:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 05:01:40] [INFO ] Invariant cache hit.
[2023-03-15 05:01:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:40] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/106 places, 46/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 50/106 places, 46/98 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s32 1) (GEQ s39 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 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 44 place count 83 transition count 70
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 54 place count 78 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 94 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 49
Applied a total of 99 rules in 20 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-15 05:01:40] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 05:01:40] [INFO ] Implicit Places using invariants in 64 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-15 05:01:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-15 05:01:41] [INFO ] Invariant cache hit.
[2023-03-15 05:01:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-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:(GEQ s36 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-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-03 finished in 300 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(!p0) U G((p1&&F(p2)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:41] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants in 76 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 05:01:41] [INFO ] Invariant cache hit.
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s34 1), p2:(AND (GEQ s37 1) (GEQ s57 1)), p0:(OR (GEQ s26 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 588 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) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 74
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 82 transition count 70
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 56 place count 78 transition count 70
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 98 place count 57 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 55 transition count 49
Applied a total of 102 rules in 13 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-15 05:01:41] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants in 73 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-15 05:01:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-15 05:01:41] [INFO ] Invariant cache hit.
[2023-03-15 05:01:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s17 1), p0:(GEQ s0 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-06 finished in 379 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((G(p1)&&p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants in 83 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-15 05:01:42] [INFO ] Invariant cache hit.
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-08 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=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s58 1) (GEQ s65 1)), p0:(AND (GEQ s10 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-08 finished in 508 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((p0&&X((p0 U (!p1||G(p0)))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants in 92 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-15 05:01:42] [INFO ] Invariant cache hit.
[2023-03-15 05:01:42] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 317 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s85 1), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 404 ms.
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 1312 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(G((F(!(p0 U p1))||(G(p0)&&p2))))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 84 transition count 72
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 50 place count 80 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 57 transition count 51
Applied a total of 95 rules in 15 ms. Remains 57 /106 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2023-03-15 05:01:43] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 05:01:44] [INFO ] Implicit Places using invariants in 73 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/106 places, 51/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 54 transition count 49
Applied a total of 4 rules in 6 ms. Remains 54 /56 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 54 cols
[2023-03-15 05:01:44] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-15 05:01:44] [INFO ] Invariant cache hit.
[2023-03-15 05:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:44] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/106 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 266 ms. Remains : 54/106 places, 49/98 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s38 1) (GEQ s46 1)), p0:(GEQ s2 1), p2:(GEQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12360 reset in 273 ms.
Product exploration explored 100000 steps with 12269 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 1227 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 754 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 732 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 749 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 755 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 05:01:45] [INFO ] Invariant cache hit.
[2023-03-15 05:01:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:01:45] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 05:01:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-15 05:01:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:01:45] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-15 05:01:45] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-15 05:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:46] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-15 05:01:46] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-15 05:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 05:01:46] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2023-03-15 05:01:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:01:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-15 05:01:46] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-15 05:01:46] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 49/49 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 43
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 43
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 48 transition count 43
Applied a total of 18 rules in 5 ms. Remains 48 /54 variables (removed 6) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/54 places, 43/49 transitions.
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 744 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 774 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Finished probabilistic random walk after 601 steps, run visited all 2 properties in 12 ms. (steps per millisecond=50 )
Probabilistic random walk after 601 steps, saw 311 distinct states, run finished after 12 ms. (steps per millisecond=50 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 11 factoid took 570 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-15 05:01:47] [INFO ] Invariant cache hit.
[2023-03-15 05:01:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 05:01:47] [INFO ] Invariant cache hit.
[2023-03-15 05:01:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-15 05:01:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:01:47] [INFO ] Invariant cache hit.
[2023-03-15 05:01:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 54/54 places, 49/49 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 780 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 749 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 748 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Probably explored full state space saw : 1996 states, properties seen :2
Probabilistic random walk after 3991 steps, saw 1996 distinct states, run finished after 25 ms. (steps per millisecond=159 ) properties seen :2
Explored full state space saw : 1996 states, properties seen :0
Exhaustive walk after 3991 steps, saw 1996 distinct states, run finished after 10 ms. (steps per millisecond=399 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 465 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[p1, p1]
Stuttering acceptance computed with spot in 80 ms :[p1, p1]
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Product exploration explored 100000 steps with 12331 reset in 315 ms.
Product exploration explored 100000 steps with 12322 reset in 211 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 48
Applied a total of 2 rules in 4 ms. Remains 53 /54 variables (removed 1) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-15 05:01:49] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:01:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-15 05:01:49] [INFO ] Invariant cache hit.
[2023-03-15 05:01:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:01:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-15 05:01:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:01:49] [INFO ] Invariant cache hit.
[2023-03-15 05:01:49] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/54 places, 48/49 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 53/54 places, 48/49 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-10 finished in 5863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((p1||(!p2 U p3)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:49] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 05:01:49] [INFO ] Implicit Places using invariants in 77 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:49] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 05:01:49] [INFO ] Invariant cache hit.
[2023-03-15 05:01:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s102 1)), p3:(GEQ s56 1), p0:(LT s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3476 reset in 135 ms.
Product exploration explored 100000 steps with 3469 reset in 155 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 172 steps, including 5 resets, run visited all 3 properties in 5 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-15 05:01:51] [INFO ] Invariant cache hit.
[2023-03-15 05:01:51] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-15 05:01:51] [INFO ] Invariant cache hit.
[2023-03-15 05:01:51] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-15 05:01:51] [INFO ] Invariant cache hit.
[2023-03-15 05:01:51] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 705 steps, including 25 resets, run visited all 3 properties in 20 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 3446 reset in 116 ms.
Product exploration explored 100000 steps with 3461 reset in 137 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 18 place count 102 transition count 98
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 98 transition count 94
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 98 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 52 place count 98 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 97 transition count 98
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 97 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 97 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 93 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 93 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 65 rules in 30 ms. Remains 93 /103 variables (removed 10) and now considering 104/97 (removed -7) transitions.
[2023-03-15 05:01:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 93 cols
[2023-03-15 05:01:53] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 93/103 places, 104/97 transitions.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:53] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-15 05:01:53] [INFO ] Invariant cache hit.
[2023-03-15 05:01:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-15 05:01:53] [INFO ] Invariant cache hit.
[2023-03-15 05:01:54] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 103/103 places, 97/97 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 4279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:54] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:54] [INFO ] Implicit Places using invariants in 80 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 05:01:54] [INFO ] Invariant cache hit.
[2023-03-15 05:01:54] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 307 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(OR (LT s58 1) (LT s65 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-13 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(!p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:01:54] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:01:54] [INFO ] Implicit Places using invariants in 82 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 05:01:55] [INFO ] Invariant cache hit.
[2023-03-15 05:01:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 293 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s86 1)), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3316 reset in 110 ms.
Product exploration explored 100000 steps with 3319 reset in 132 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 60 ms. (steps per millisecond=122 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 60 ms. (steps per millisecond=122 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-15 05:01:57] [INFO ] Invariant cache hit.
[2023-03-15 05:01:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-15 05:01:57] [INFO ] Invariant cache hit.
[2023-03-15 05:01:57] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-15 05:01:57] [INFO ] Invariant cache hit.
[2023-03-15 05:01:57] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 59 ms. (steps per millisecond=124 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 59 ms. (steps per millisecond=124 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 3324 reset in 112 ms.
Product exploration explored 100000 steps with 3331 reset in 126 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 24 place count 102 transition count 99
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 102 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 98 transition count 95
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 98 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 57 place count 98 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 97 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 97 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 97 transition count 114
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 73 rules in 18 ms. Remains 92 /103 variables (removed 11) and now considering 104/97 (removed -7) transitions.
[2023-03-15 05:01:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 92 cols
[2023-03-15 05:01:59] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-15 05:01:59] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 92/103 places, 104/97 transitions.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-15 05:01:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:01:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-15 05:01:59] [INFO ] Invariant cache hit.
[2023-03-15 05:02:00] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-15 05:02:00] [INFO ] Invariant cache hit.
[2023-03-15 05:02:00] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 103/103 places, 97/97 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 5234 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(G((F(!(p0 U p1))||(G(p0)&&p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((p1||(!p2 U p3)))))'
Found a Lengthening insensitive property : DoubleExponent-PT-002-LTLFireability-12
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 81
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 89 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 87 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 87 transition count 76
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 42 place count 84 transition count 76
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 82 place count 64 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 63 transition count 56
Applied a total of 84 rules in 10 ms. Remains 63 /106 variables (removed 43) and now considering 56/98 (removed 42) transitions.
// Phase 1: matrix 56 rows 63 cols
[2023-03-15 05:02:00] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 05:02:00] [INFO ] Implicit Places using invariants in 72 ms returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/106 places, 56/98 transitions.
Graph (complete) has 156 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 52
Applied a total of 7 rules in 6 ms. Remains 57 /61 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-15 05:02:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 05:02:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-15 05:02:00] [INFO ] Invariant cache hit.
[2023-03-15 05:02:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:00] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 57/106 places, 52/98 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 257 ms. Remains : 57/106 places, 52/98 transitions.
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s56 1)), p3:(GEQ s32 1), p0:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10837 reset in 191 ms.
Product exploration explored 100000 steps with 10792 reset in 178 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 151 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-15 05:02:02] [INFO ] Invariant cache hit.
[2023-03-15 05:02:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-15 05:02:02] [INFO ] Invariant cache hit.
[2023-03-15 05:02:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:02] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-15 05:02:02] [INFO ] Invariant cache hit.
[2023-03-15 05:02:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 57/57 places, 52/52 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 151 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 61 steps, including 5 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 10825 reset in 138 ms.
Product exploration explored 100000 steps with 10795 reset in 155 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 56 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 56 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 5 ms. Remains 56 /57 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-15 05:02:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2023-03-15 05:02:03] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-15 05:02:03] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/57 places, 52/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 56/57 places, 52/52 transitions.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-15 05:02:03] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-15 05:02:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-15 05:02:03] [INFO ] Invariant cache hit.
[2023-03-15 05:02:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:04] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-15 05:02:04] [INFO ] Invariant cache hit.
[2023-03-15 05:02:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 57/57 places, 52/52 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 3882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(!p1)))))'
Found a Lengthening insensitive property : DoubleExponent-PT-002-LTLFireability-14
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 81 transition count 69
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 56 place count 77 transition count 69
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 2 with 38 rules applied. Total rules applied 94 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 56 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 55 transition count 49
Applied a total of 101 rules in 11 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-15 05:02:04] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 05:02:04] [INFO ] Implicit Places using invariants in 70 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 3 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-15 05:02:04] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-15 05:02:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-15 05:02:04] [INFO ] Invariant cache hit.
[2023-03-15 05:02:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:04] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 233 ms. Remains : 49/106 places, 45/98 transitions.
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s40 1)), p1:(AND (GEQ s4 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13859 reset in 126 ms.
Product exploration explored 100000 steps with 13782 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 142 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 1376 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 799 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2304 steps, run visited all 3 properties in 21 ms. (steps per millisecond=109 )
Probabilistic random walk after 2304 steps, saw 1183 distinct states, run finished after 21 ms. (steps per millisecond=109 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-15 05:02:06] [INFO ] Invariant cache hit.
[2023-03-15 05:02:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-15 05:02:06] [INFO ] Invariant cache hit.
[2023-03-15 05:02:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:06] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-15 05:02:06] [INFO ] Invariant cache hit.
[2023-03-15 05:02:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 49/49 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 142 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 1355 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2304 steps, run visited all 3 properties in 23 ms. (steps per millisecond=100 )
Probabilistic random walk after 2304 steps, saw 1183 distinct states, run finished after 24 ms. (steps per millisecond=96 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 13977 reset in 129 ms.
Product exploration explored 100000 steps with 13896 reset in 142 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-15 05:02:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:02:08] [INFO ] Invariant cache hit.
[2023-03-15 05:02:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 49/49 places, 45/45 transitions.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-15 05:02:09] [INFO ] Invariant cache hit.
[2023-03-15 05:02:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-15 05:02:09] [INFO ] Invariant cache hit.
[2023-03-15 05:02:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:02:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-15 05:02:09] [INFO ] Invariant cache hit.
[2023-03-15 05:02:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 49/49 places, 45/45 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 5071 ms.
[2023-03-15 05:02:09] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:02:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 05:02:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 98 transitions and 272 arcs took 1 ms.
Total runtime 37305 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1976/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1976/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1976/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-002-LTLFireability-10
Could not compute solution for formula : DoubleExponent-PT-002-LTLFireability-12
Could not compute solution for formula : DoubleExponent-PT-002-LTLFireability-14

BK_STOP 1678856530625

--------------------
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-002-LTLFireability-10
ltl formula formula --ltl=/tmp/1976/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 106 places, 98 transitions and 272 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1976/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1976/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1976/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1976/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DoubleExponent-PT-002-LTLFireability-12
ltl formula formula --ltl=/tmp/1976/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 98 transitions and 272 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.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1976/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1976/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1976/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1976/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DoubleExponent-PT-002-LTLFireability-14
ltl formula formula --ltl=/tmp/1976/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
pnml2lts-mc( 0/ 4): Petri net has 106 places, 98 transitions and 272 arcs
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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1976/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1976/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1976/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1976/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

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

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

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