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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.7K Apr 29 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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-Z4T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653130544621

Running Version 202205111006
[2022-05-21 10:55:46] [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:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:55:47] [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:55:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 10:55:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1190 ms
[2022-05-21 10:55:48] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 10:55:48] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2022-05-21 10:55:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 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 178 steps, including 0 resets, run visited all 11 properties in 36 ms. (steps per millisecond=4 )
[2022-05-21 10:55:48] [INFO ] Flatten gal took : 42 ms
[2022-05-21 10:55:48] [INFO ] Flatten gal took : 9 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 10:55:48] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 42 ms.
[2022-05-21 10:55:48] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-21 10:55:48] [INFO ] Reduced 12 identical enabling conditions.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 137 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 18 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2022-05-21 10:55:49] [INFO ] Computed 11 place invariants in 47 ms
[2022-05-21 10:55:49] [INFO ] Implicit Places using invariants in 489 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 553 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 236/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/154 places, 236/236 transitions.
Support contains 137 out of 153 places after structural reductions.
[2022-05-21 10:55:49] [INFO ] Flatten gal took : 71 ms
[2022-05-21 10:55:49] [INFO ] Flatten gal took : 62 ms
[2022-05-21 10:55:50] [INFO ] Input system was already deterministic with 236 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 15 properties in 9 ms. (steps per millisecond=2 )
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' '!(F((G(p0)||X(p1)||(X(!p0)&&p2))))'
Support contains 89 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:55:50] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-21 10:55:50] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:55:50] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-21 10:55:50] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:55:50] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-21 10:55:51] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1382 ms.
Product exploration explored 100000 steps with 50000 reset in 1272 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) p1 p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) p1 p0)
Knowledge based reduction with 8 factoid took 289 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 finished in 4163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 13 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:55:54] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:55:54] [INFO ] Implicit Places using invariants in 122 ms returned [76]
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 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s61 1) (GEQ s85 1)) (AND (GEQ s68 1) (GEQ s87 1)) (AND (GEQ s71 1) (GEQ s87 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s66 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][false, false, false]]
Product exploration explored 100000 steps with 890 reset in 841 ms.
Stack based approach found an accepted trace after 22867 steps with 221 reset with depth 166 and stack size 166 in 119 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 1265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(X(F((G(p1)||p2))))||p0))&&p3))))'
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 7 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:55:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:55:56] [INFO ] Implicit Places using invariants in 123 ms returned [76]
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 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p3 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p0) (NOT p2) p1)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p3:(OR (AND (GEQ s61 1) (GEQ s85 1)) (AND (GEQ s68 1) (GEQ s87 1)) (AND (GEQ s71 1) (GEQ s87 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s66 1) (GEQ s86 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3275 reset in 464 ms.
Stack based approach found an accepted trace after 63159 steps with 2076 reset with depth 36 and stack size 36 in 336 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 1296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U !(G(p0) U p1))))'
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 101 transition count 184
Applied a total of 104 rules in 29 ms. Remains 101 /153 variables (removed 52) and now considering 184/236 (removed 52) transitions.
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:55:57] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:55:57] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:55:57] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:55:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-21 10:55:57] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:55:57] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 10:55:57] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/153 places, 184/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/153 places, 184/236 transitions.
Stuttering acceptance computed with spot in 159 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s35 1) (GEQ s34 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10767 reset in 401 ms.
Product exploration explored 100000 steps with 10697 reset in 486 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 p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 565 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 695 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 194 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Support contains 37 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:56:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:00] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:56:00] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 10:56:00] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-05-21 10:56:00] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 184 rows 101 cols
[2022-05-21 10:56:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:01] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 184/184 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 598 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 226 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 739 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 176 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 174 ms :[p1, (NOT p0), p1, (AND p0 p1)]
Product exploration explored 100000 steps with 10712 reset in 846 ms.
Stack based approach found an accepted trace after 61798 steps with 6633 reset with depth 23 and stack size 23 in 369 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 finished in 7207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p1)&&p0)))&&X(F(G(p1)))))'
Support contains 25 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 13 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:04] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:04] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:04] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p0:(AND (OR (LT s0 1) (LT s13 1) (LT s76 1)) (OR (LT s2 1) (LT s16 1) (LT s76 1)) (OR (LT s0 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(p0)||X(p1)) U X(((X(F(p1))&&p2) U p1))))'
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 10 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:05] [INFO ] Implicit Places using invariants in 145 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, p0, p1, p1, (AND p0 p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (GEQ s78 1) (GEQ s79 1) (GEQ s76 1) (GEQ s77 1)), p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p2:(OR (AND (GEQ s61 1) (GEQ s85 1)) (AND (G...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X((G(p1) U X(p2)))&&p1)))'
Support contains 89 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:56:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:05] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:56:05] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 10:56:05] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 153 cols
[2022-05-21 10:56:05] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-21 10:56:06] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), true, (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=p1, acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (GEQ s129 1) (GEQ s130 1) (GEQ s131 1) (GEQ s132 1)), p0:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 finished in 1139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(X(F(p0))))))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 70 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 70 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 58 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 46 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 46 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 34 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 34 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 34 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 26 transition count 24
Applied a total of 282 rules in 25 ms. Remains 26 /153 variables (removed 127) and now considering 24/236 (removed 212) transitions.
// Phase 1: matrix 24 rows 26 cols
[2022-05-21 10:56:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:06] [INFO ] Implicit Places using invariants in 41 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/153 places, 24/236 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 24 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 20
Applied a total of 8 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 10:56:06] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 10:56:06] [INFO ] Implicit Places using invariants in 37 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/153 places, 20/236 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 16
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 12
Applied a total of 12 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-21 10:56:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 10:56:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2022-05-21 10:56:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 10:56:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 12/153 places, 12/236 transitions.
Finished structural reductions, in 3 iterations. Remains : 12/153 places, 12/236 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-12 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)) (OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 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 14842 reset in 204 ms.
Stack based approach found an accepted trace after 796 steps with 123 reset with depth 10 and stack size 10 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-12 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 21 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 4 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:07] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:07] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:07] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-21 10:56:07] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s13 1) (GEQ s76 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s76 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s76 1)) (AND (GEQ s1 1) (GEQ 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][false, false]]
Product exploration explored 100000 steps with 26790 reset in 813 ms.
Product exploration explored 100000 steps with 26732 reset in 665 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 253 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 188 rows 105 cols
[2022-05-21 10:56:09] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 10:56:10] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-21 10:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:10] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-21 10:56:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-05-21 10:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:11] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-21 10:56:11] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-21 10:56:12] [INFO ] Added : 139 causal constraints over 28 iterations in 805 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 172
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 89 transition count 172
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 73 transition count 156
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 80 place count 73 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 69 transition count 136
Applied a total of 88 rules in 22 ms. Remains 69 /105 variables (removed 36) and now considering 136/188 (removed 52) transitions.
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:12] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:12] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-21 10:56:12] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:12] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:12] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/105 places, 136/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/105 places, 136/188 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:13] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-21 10:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:13] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-05-21 10:56:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-21 10:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:14] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-21 10:56:14] [INFO ] Computed and/alt/rep : 116/256/116 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-21 10:56:14] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 44727 reset in 1034 ms.
Product exploration explored 100000 steps with 44659 reset in 682 ms.
Built C files in :
/tmp/ltsmin7699106298395187811
[2022-05-21 10:56:16] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2022-05-21 10:56:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:16] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2022-05-21 10:56:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:16] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2022-05-21 10:56:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:16] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7699106298395187811
Running compilation step : cd /tmp/ltsmin7699106298395187811;'/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 898 ms.
Running link step : cd /tmp/ltsmin7699106298395187811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7699106298395187811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10190957148255539232.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 finished in 10155 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F((F(p1) U (X(p2)&&F(p1)))))||p0)))'
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Applied a total of 176 rules in 25 ms. Remains 73 /153 variables (removed 80) and now considering 140/236 (removed 96) transitions.
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:17] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:17] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:17] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2022-05-21 10:56:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:17] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/153 places, 140/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/153 places, 140/236 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s49 1) (GEQ s50 1) (GEQ s51 1) (GEQ s52 1) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s44 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s44 1)) (AND (GEQ s0 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10381 reset in 1001 ms.
Product exploration explored 100000 steps with 10519 reset in 623 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) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 672 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2)]
Knowledge based reduction with 8 factoid took 695 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:21] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-21 10:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:21] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-21 10:56:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-21 10:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:22] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-21 10:56:22] [INFO ] Computed and/alt/rep : 136/292/136 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-21 10:56:23] [INFO ] Added : 120 causal constraints over 26 iterations in 514 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-21 10:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:23] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-21 10:56:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-21 10:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:23] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-21 10:56:23] [INFO ] Computed and/alt/rep : 136/292/136 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-21 10:56:23] [INFO ] Added : 121 causal constraints over 25 iterations in 524 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 25 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 140/140 transitions.
Applied a total of 0 rules in 7 ms. Remains 73 /73 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:24] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:24] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2022-05-21 10:56:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:24] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 140/140 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) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 392 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p2)]
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:25] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:56:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-21 10:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:26] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-21 10:56:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-21 10:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:26] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-21 10:56:26] [INFO ] Computed and/alt/rep : 136/292/136 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-21 10:56:27] [INFO ] Added : 120 causal constraints over 26 iterations in 525 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 140 rows 73 cols
[2022-05-21 10:56:27] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:27] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-21 10:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:27] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-21 10:56:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:56:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-21 10:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:56:27] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-21 10:56:27] [INFO ] Computed and/alt/rep : 136/292/136 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-21 10:56:28] [INFO ] Added : 121 causal constraints over 25 iterations in 527 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10266 reset in 585 ms.
Product exploration explored 100000 steps with 10439 reset in 603 ms.
Built C files in :
/tmp/ltsmin5143543458081632972
[2022-05-21 10:56:29] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2022-05-21 10:56:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:29] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2022-05-21 10:56:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:29] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2022-05-21 10:56:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:29] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5143543458081632972
Running compilation step : cd /tmp/ltsmin5143543458081632972;'/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 659 ms.
Running link step : cd /tmp/ltsmin5143543458081632972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5143543458081632972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9781818356383111084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 140/140 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 136
Applied a total of 8 rules in 7 ms. Remains 69 /73 variables (removed 4) and now considering 136/140 (removed 4) transitions.
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:44] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:44] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-21 10:56:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 69 cols
[2022-05-21 10:56:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 10:56:44] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/73 places, 136/140 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/73 places, 136/140 transitions.
Built C files in :
/tmp/ltsmin13077214423142844150
[2022-05-21 10:56:44] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2022-05-21 10:56:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:44] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2022-05-21 10:56:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:44] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2022-05-21 10:56:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:56:44] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13077214423142844150
Running compilation step : cd /tmp/ltsmin13077214423142844150;'/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 672 ms.
Running link step : cd /tmp/ltsmin13077214423142844150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13077214423142844150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2065871769305667202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 10:57:00] [INFO ] Flatten gal took : 16 ms
[2022-05-21 10:57:00] [INFO ] Flatten gal took : 15 ms
[2022-05-21 10:57:00] [INFO ] Time to serialize gal into /tmp/LTL15613746723772967524.gal : 4 ms
[2022-05-21 10:57:00] [INFO ] Time to serialize properties into /tmp/LTL10990900756357827661.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15613746723772967524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10990900756357827661.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1561374...268
Read 1 LTL properties
Checking formula 0 : !((G((((((((G(F((F("(((((((((IdleTechs_0>=1)&&(OpenRequests_5>=1))&&(Idles_0>=1))||(((IdleTechs_2>=1)&&(OpenRequests_8>=1))&&(Idles_0>...11653
Formula 0 simplified : !G("((((((((IdleTechs_1>=1)&&(OpenRequests_13>=1))&&(Idles_0>=1))||(((IdleTechs_0>=1)&&(OpenRequests_8>=1))&&(Idles_0>=1)))||((((Idl...11619
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
54 unique states visited
0 strongly connected components in search stack
82 transitions explored
24 items max in DFS search stack
946 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.53424,218312,1,0,1013,1.08456e+06,75,322,2590,1.13438e+06,2202
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 finished in 54044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(F(p0)))&&G(p0)))))'
Support contains 64 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 153 transition count 220
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 137 transition count 220
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 80 place count 113 transition count 196
Applied a total of 80 rules in 14 ms. Remains 113 /153 variables (removed 40) and now considering 196/236 (removed 40) transitions.
// Phase 1: matrix 196 rows 113 cols
[2022-05-21 10:57:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 10:57:11] [INFO ] Implicit Places using invariants in 135 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/153 places, 196/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/153 places, 196/236 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GE...], 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 401 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 finished in 625 ms.
All properties solved by simple procedures.
Total runtime 84931 ms.

BK_STOP 1653130632038

--------------------
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-Z4T4N04"
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-Z4T4N04, 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-165307353000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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