About the Execution of ITS-Tools for UtilityControlRoom-COL-Z4T4N02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 411.004 | 30072.00 | 55810.00 | 400.30 | TFFFFFFTTTFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353000108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353000108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 6.9K Apr 29 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 29 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653129724024
Running Version 202205111006
[2022-05-21 10:42:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 10:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:42:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 10:42:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 10:42:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1510 ms
[2022-05-21 10:42:07] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 80 PT places and 150.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 10:42:08] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 11 ms.
[2022-05-21 10:42:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1567 steps, including 0 resets, run visited all 13 properties in 91 ms. (steps per millisecond=17 )
[2022-05-21 10:42:08] [INFO ] Flatten gal took : 41 ms
[2022-05-21 10:42:08] [INFO ] Flatten gal took : 7 ms
Domain [Cli(2), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
[2022-05-21 10:42:08] [INFO ] Unfolded HLPN to a Petri net with 80 places and 150 transitions 482 arcs in 28 ms.
[2022-05-21 10:42:08] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2022-05-21 10:42:08] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 10:42:08] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 10:42:08] [INFO ] Reduced 6 identical enabling conditions.
[2022-05-21 10:42:08] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 71 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2022-05-21 10:42:08] [INFO ] Computed 7 place invariants in 24 ms
[2022-05-21 10:42:08] [INFO ] Implicit Places using invariants in 260 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 79/80 places, 118/118 transitions.
Support contains 71 out of 79 places after structural reductions.
[2022-05-21 10:42:08] [INFO ] Flatten gal took : 38 ms
[2022-05-21 10:42:09] [INFO ] Flatten gal took : 47 ms
[2022-05-21 10:42:09] [INFO ] Input system was already deterministic with 118 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 17 properties in 4 ms. (steps per millisecond=5 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U G((p0 U (!F(p1) U p1))))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:09] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 10:42:09] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:09] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-21 10:42:09] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:09] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-21 10:42:10] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 415 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s41 1)), p1:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ ...], 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 33333 reset in 464 ms.
Product exploration explored 100000 steps with 33333 reset in 293 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 (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(G(p0)))&&p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:11] [INFO ] Implicit Places using invariants in 94 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 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: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1)), p0:(OR (GEQ s43 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 347 steps with 0 reset with depth 348 and stack size 348 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 finished in 481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 44 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 38 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 38 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 31 transition count 42
Applied a total of 103 rules in 17 ms. Remains 31 /79 variables (removed 48) and now considering 42/118 (removed 76) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-21 10:42:11] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants in 71 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/79 places, 42/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 30 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 22 transition count 34
Applied a total of 16 rules in 4 ms. Remains 22 /30 variables (removed 8) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 22 cols
[2022-05-21 10:42:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 34 rows 22 cols
[2022-05-21 10:42:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/79 places, 34/118 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/79 places, 34/118 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s16 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s13 1) (LT s18 1)) (OR (LT s10 1) (LT s18 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 12 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants in 123 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s43 1) (LT s42 1) (OR (LT s31 1) (LT s44 1)) (OR (LT s36 1) (LT s45 1)) (OR (LT s30 1) (LT s44 1)) (OR (LT s32 1) (LT s44 1)) (OR (LT s37 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)&&p0))||G(p2))))'
Support contains 25 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:12] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:12] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 10:42:12] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:13] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(AND (OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ...], 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1235 reset in 357 ms.
Stack based approach found an accepted trace after 151 steps with 0 reset with depth 152 and stack size 152 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 finished in 994 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 34 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 10:42:13] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-21 10:42:13] [INFO ] Implicit Places using invariants in 122 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/79 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s67 1) (GEQ s66 1)), p0:(OR (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(F(p0)))))))'
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 18 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 10:42:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:14] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 10:42:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-21 10:42:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 10:42:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:14] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s11 1) (LT s22 1)) (OR (LT s2 1) (LT s10 1) (LT s22 1)) (OR (LT s3 1) (LT s7 1) (LT s22 1)) (OR (LT s1 1) (LT s9 1) (LT s22 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12354 reset in 215 ms.
Stack based approach found an accepted trace after 20633 steps with 2566 reset with depth 9 and stack size 9 in 76 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 finished in 633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(F(X(p1))&&G(X(p1)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:14] [INFO ] Implicit Places using invariants in 83 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s39 1) (GEQ s38 1)), p1:(OR (GEQ s41 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 224 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 finished in 878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(p0))||G(p1)))||(F(!p0)&&F(p2))))'
Support contains 25 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:15] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 10:42:15] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:15] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-21 10:42:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s3 1) (LT s13 1) (LT s40 1)) (OR (LT s2 1) (LT s12 1) (LT s40 1)) (OR (LT s3 1) (LT s9 1) (LT s40 1)) (OR (LT s1 1) (LT s11 1) (LT s40 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 finished in 401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(F((X((!(p0 U p1)&&X(!p0)))||p2)))))))'
Support contains 20 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:15] [INFO ] Implicit Places using invariants in 59 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p2:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s20 1) (LT s21 1) (LT s14 1) (LT s15 1)), p1:(OR (AND (GEQ s31 1) (GEQ s44 1)) (AND (GEQ s36 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9178 reset in 216 ms.
Product exploration explored 100000 steps with 9140 reset in 226 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 54 cols
[2022-05-21 10:42:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:17] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-21 10:42:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 842 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Support contains 20 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2022-05-21 10:42:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:18] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 94 rows 54 cols
[2022-05-21 10:42:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 54 cols
[2022-05-21 10:42:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-21 10:42:18] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 94/94 transitions.
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 (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 479 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 566 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 9133 reset in 234 ms.
Product exploration explored 100000 steps with 9244 reset in 255 ms.
Built C files in :
/tmp/ltsmin12966205262346208755
[2022-05-21 10:42:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12966205262346208755
Running compilation step : cd /tmp/ltsmin12966205262346208755;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 576 ms.
Running link step : cd /tmp/ltsmin12966205262346208755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12966205262346208755;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3092461450324815454.hoa' '--buchi-type=spotba'
LTSmin run took 1074 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 finished in 7483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:23] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 10:42:23] [INFO ] Implicit Places using invariants in 82 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 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:(OR (GEQ s43 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(F(G(p0)))||p1))&&G(F(G(F(p1)))))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:23] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:23] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:23] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-21 10:42:23] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:23] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 10:42:23] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s3 1) (LT s13 1) (LT s40 1)) (OR (LT s2 1) (LT s12 1) (LT s40 1)) (OR (LT s3 1) (LT s9 1) (LT s40 1)) (OR (LT s1 1) (LT s11 1) (LT s40 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 126 steps with 1 reset with depth 123 and stack size 123 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((F(X(X(p0)))&&p1))))'
Support contains 36 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 10:42:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:24] [INFO ] Implicit Places using invariants in 103 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GE...], 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 20925 reset in 206 ms.
Product exploration explored 100000 steps with 20886 reset in 207 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 p0 (NOT p1)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 118 rows 78 cols
[2022-05-21 10:42:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:25] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:42:25] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-21 10:42:25] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 10:42:25] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 36 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 78 cols
[2022-05-21 10:42:25] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-21 10:42:25] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 118 rows 78 cols
[2022-05-21 10:42:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-21 10:42:26] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 78 cols
[2022-05-21 10:42:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:26] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 118/118 transitions.
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 p0 (NOT p1)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 118 rows 78 cols
[2022-05-21 10:42:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 10:42:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-21 10:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:42:27] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-21 10:42:27] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-21 10:42:27] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20932 reset in 323 ms.
Product exploration explored 100000 steps with 20962 reset in 245 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 36 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 118/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 78 transition count 126
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 126
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 126
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 11 ms. Remains 78 /78 variables (removed 0) and now considering 126/118 (removed -8) transitions.
[2022-05-21 10:42:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 126 rows 78 cols
[2022-05-21 10:42:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-21 10:42:28] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 126/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 126/118 transitions.
Product exploration explored 100000 steps with 21166 reset in 484 ms.
Product exploration explored 100000 steps with 21128 reset in 484 ms.
Built C files in :
/tmp/ltsmin11799092445064349769
[2022-05-21 10:42:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11799092445064349769
Running compilation step : cd /tmp/ltsmin11799092445064349769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin11799092445064349769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11799092445064349769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15789381211179571103.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 finished in 5979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(F(p2)||p1)))))'
Support contains 55 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 10:42:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:30] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 10:42:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 10:42:30] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 10:42:30] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-21 10:42:30] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s55 1) (GEQ s69 1)) (AND (GEQ s60 1) (GEQ s70 1)) (AND (GEQ s54 1) (GEQ s69 1)) (AND (GEQ s56 1) (GEQ s69 1)) (AND (GEQ s61 1) (GEQ s70 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3957 reset in 1028 ms.
Stack based approach found an accepted trace after 1068 steps with 40 reset with depth 15 and stack size 15 in 9 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 finished in 1552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(X(p2)||p1)) U (!p3 U p2)))'
Support contains 27 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 2 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:31] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 10:42:31] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:31] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 10:42:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 10:42:31] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 10:42:31] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p3 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (GEQ s39 1) (GEQ s38 1)), p3:(OR (GEQ s42 1) (GEQ s41 1)), p0:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s40 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 702 ms.
Product exploration explored 100000 steps with 50000 reset in 537 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 (NOT p2) (NOT p3) (NOT p0) p1), (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p1)))))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 667 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 finished in 2310 ms.
All properties solved by simple procedures.
Total runtime 27922 ms.
BK_STOP 1653129754096
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T4N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z4T4N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-165307353000108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N02.tgz
mv UtilityControlRoom-COL-Z4T4N02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;