About the Execution of LTSMin+red for RefineWMG-PT-015015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 368.228 | 19645.00 | 31112.00 | 393.80 | FFFFFFF?FTFFFFFF | normal |
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.r329-tall-167889202200595.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 RefineWMG-PT-015015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202200595
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 35K Mar 5 18:23 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 RefineWMG-PT-015015-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679151203380
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-015015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 14:53:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 14:53:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:53:25] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-18 14:53:25] [INFO ] Transformed 79 places.
[2023-03-18 14:53:25] [INFO ] Transformed 63 transitions.
[2023-03-18 14:53:25] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-015015-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 19 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 14:53:25] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-18 14:53:25] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
[2023-03-18 14:53:25] [INFO ] Invariant cache hit.
[2023-03-18 14:53:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 14:53:25] [INFO ] Invariant cache hit.
[2023-03-18 14:53:26] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-18 14:53:26] [INFO ] Invariant cache hit.
[2023-03-18 14:53:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 37 out of 79 places after structural reductions.
[2023-03-18 14:53:26] [INFO ] Flatten gal took : 27 ms
[2023-03-18 14:53:26] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:53:26] [INFO ] Input system was already deterministic with 63 transitions.
Support contains 36 out of 79 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 14:53:26] [INFO ] Invariant cache hit.
[2023-03-18 14:53:26] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 14:53:26] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-18 14:53:27] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 14:53:27] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-18 14:53:27] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 704 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=176 )
Parikh walk visited 12 properties in 19 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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((X(F(p0))&&F(p1)))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:27] [INFO ] Invariant cache hit.
[2023-03-18 14:53:27] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-18 14:53:27] [INFO ] Invariant cache hit.
[2023-03-18 14:53:28] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 14:53:28] [INFO ] Invariant cache hit.
[2023-03-18 14:53:28] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-18 14:53:28] [INFO ] Invariant cache hit.
[2023-03-18 14:53:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s1 s21), p0:(OR (LEQ s7 s57) (LEQ s1 s21) (LEQ s68 s21))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 475 ms.
Stack based approach found an accepted trace after 14 steps with 1 reset with depth 11 and stack size 11 in 16 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-00 finished in 1117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 40 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 5 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 55 place count 25 transition count 24
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 25 transition count 16
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 71 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 71 place count 17 transition count 13
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 77 place count 14 transition count 13
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 3 with 2 rules applied. Total rules applied 79 place count 13 transition count 12
Applied a total of 79 rules in 20 ms. Remains 13 /79 variables (removed 66) and now considering 12/63 (removed 51) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-18 14:53:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 14:53:29] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 12/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 13/79 places, 12/63 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s8), p1:(GT s11 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-01 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 48 place count 27 transition count 23
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 27 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 21 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 21 transition count 15
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 64 place count 19 transition count 15
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 3 with 2 rules applied. Total rules applied 66 place count 18 transition count 14
Applied a total of 66 rules in 11 ms. Remains 18 /79 variables (removed 61) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-18 14:53:29] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 14:53:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/79 places, 14/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 18/79 places, 14/63 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(AND (LEQ s12 s9) (LEQ s14 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-02 finished in 344 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)||F(G((p1||F(p2))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 40 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 55 place count 25 transition count 24
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 25 transition count 15
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 73 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 16 transition count 13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 14 transition count 13
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 3 with 2 rules applied. Total rules applied 79 place count 13 transition count 12
Applied a total of 79 rules in 11 ms. Remains 13 /79 variables (removed 66) and now considering 12/63 (removed 51) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-18 14:53:29] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 14:53:29] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 14:53:29] [INFO ] Invariant cache hit.
[2023-03-18 14:53:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 12/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 13/79 places, 12/63 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s8), p1:(GT 1 s6), p2:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-03 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||(p1 U p2)||X(p0)))||G(p3)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 14:53:29] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-18 14:53:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:30] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s51 s7), p2:(LEQ 2 s24), p3:(GT 2 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4487 reset in 396 ms.
Stack based approach found an accepted trace after 13506 steps with 354 reset with depth 889 and stack size 869 in 63 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-04 finished in 864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:30] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 14:53:30] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT s22 s12), p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-05 finished in 600 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 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 21 transition count 9
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 83 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 83 place count 9 transition count 8
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 85 place count 8 transition count 8
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 3 with 2 rules applied. Total rules applied 87 place count 7 transition count 7
Applied a total of 87 rules in 13 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 14:53:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 14:53:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-18 14:53:31] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/79 places, 7/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s5)], 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 136 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-06 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G((G(p1)||X(F(!p1)))) U G(p2))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
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 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 61 place count 27 transition count 16
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 18 transition count 14
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 74 place count 16 transition count 14
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 3 with 2 rules applied. Total rules applied 76 place count 15 transition count 13
Applied a total of 76 rules in 8 ms. Remains 15 /79 variables (removed 64) and now considering 13/63 (removed 50) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-18 14:53:31] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-18 14:53:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 14:53:31] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 14:53:31] [INFO ] Invariant cache hit.
[2023-03-18 14:53:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/79 places, 13/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 15/79 places, 13/63 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p0)), p1, (NOT p0), false, (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s5 s12), p1:(LEQ s8 s3), p0:(LEQ 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33308 reset in 200 ms.
Product exploration explored 100000 steps with 33389 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 643 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :3
Finished Best-First random walk after 2291 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=572 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 806 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-18 14:53:34] [INFO ] Invariant cache hit.
[2023-03-18 14:53:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 14:53:34] [INFO ] Invariant cache hit.
[2023-03-18 14:53:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 14:53:34] [INFO ] Invariant cache hit.
[2023-03-18 14:53:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 14:53:34] [INFO ] Invariant cache hit.
[2023-03-18 14:53:34] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 15/15 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 596 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :3
Finished Best-First random walk after 766 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=255 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 682 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 33327 reset in 111 ms.
Product exploration explored 100000 steps with 33299 reset in 99 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), p1, false, (NOT p2), (AND p1 (NOT p2))]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 13/13 transitions.
Graph (trivial) has 2 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 5 ms. Remains 13 /15 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-18 14:53:37] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 14:53:37] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-18 14:53:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/15 places, 11/13 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 13/15 places, 11/13 transitions.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-18 14:53:37] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 14:53:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 15/15 places, 13/13 transitions.
Treatment of property RefineWMG-PT-015015-LTLCardinality-07 finished in 6216 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))||(p1 U X(G(p2)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 14:53:37] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-18 14:53:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-18 14:53:37] [INFO ] Invariant cache hit.
[2023-03-18 14:53:38] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s47) (LEQ s15 s24)), p0:(LEQ s15 s24), p2:(LEQ 1 s74)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 12 factoid took 266 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-015015-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-015015-LTLCardinality-09 finished in 1077 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(G(p1)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:38] [INFO ] Invariant cache hit.
[2023-03-18 14:53:38] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-18 14:53:38] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-10 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 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s57 s78), p1:(GT 3 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-10 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 s7)], 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 67 reset in 267 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-11 finished in 585 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(X(X(X(F(p0)))))))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 14:53:39] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ 3 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 638 reset in 275 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-12 finished in 721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 56 place count 23 transition count 22
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 67 place count 23 transition count 11
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 12 transition count 10
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 80 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 82 place count 10 transition count 9
Applied a total of 82 rules in 6 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 14:53:40] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 14:53:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 14:53:40] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 9/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 10/79 places, 9/63 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s8)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-13 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 14:53:40] [INFO ] Computed 32 place invariants in 0 ms
[2023-03-18 14:53:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:40] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-18 14:53:40] [INFO ] Invariant cache hit.
[2023-03-18 14:53:41] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-14 finished in 336 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(!p0)&&F(p1))||X(G(!p0)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 14:53:41] [INFO ] Invariant cache hit.
[2023-03-18 14:53:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-18 14:53:41] [INFO ] Invariant cache hit.
[2023-03-18 14:53:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 14:53:41] [INFO ] Invariant cache hit.
[2023-03-18 14:53:41] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-18 14:53:41] [INFO ] Invariant cache hit.
[2023-03-18 14:53:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 239 ms :[p0, p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s70 s26), p0:(GT 2 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 301 ms.
Stack based approach found an accepted trace after 1332 steps with 1 reset with depth 1330 and stack size 1280 in 5 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-15 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G((G(p1)||X(F(!p1)))) U G(p2))))'
[2023-03-18 14:53:41] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:53:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-18 14:53:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 63 transitions and 188 arcs took 1 ms.
Total runtime 16839 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1418/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RefineWMG-PT-015015-LTLCardinality-07
BK_STOP 1679151223025
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RefineWMG-PT-015015-LTLCardinality-07
ltl formula formula --ltl=/tmp/1418/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 79 places, 63 transitions and 188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1418/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1418/ltl_0_
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/1418/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1418/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-015015"
export BK_EXAMINATION="LTLCardinality"
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 RefineWMG-PT-015015, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202200595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015015.tgz
mv RefineWMG-PT-015015 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;