Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707601068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707601068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 14:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 14:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 14:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679337353838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:35:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:35:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:35:55] [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.
[2023-03-20 18:35:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:35:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 440 ms
[2023-03-20 18:35:55] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:35:56] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-20 18:35:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 455 steps, including 0 resets, run visited all 14 properties in 22 ms. (steps per millisecond=20 )
[2023-03-20 18:35:56] [INFO ] Flatten gal took : 14 ms
[2023-03-20 18:35:56] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 18:35:56] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 18 ms.
[2023-03-20 18:35:56] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2023-03-20 18:35:56] [INFO ] Reduced 18 identical enabling conditions.
[2023-03-20 18:35:56] [INFO ] Reduced 18 identical enabling conditions.
[2023-03-20 18:35:56] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 203 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2023-03-20 18:35:56] [INFO ] Computed 15 place invariants in 29 ms
[2023-03-20 18:35:56] [INFO ] Implicit Places using invariants in 236 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 203 out of 227 places after structural reductions.
[2023-03-20 18:35:56] [INFO ] Flatten gal took : 42 ms
[2023-03-20 18:35:56] [INFO ] Flatten gal took : 51 ms
[2023-03-20 18:35:57] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 18:35:57] [INFO ] Computed 14 place invariants in 11 ms
[2023-03-20 18:35:57] [INFO ] After 42ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-20 18:35:57] [INFO ] Invariant cache hit.
[2023-03-20 18:35:57] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-20 18:35:57] [INFO ] Invariant cache hit.
[2023-03-20 18:35:58] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-20 18:35:58] [INFO ] Invariant cache hit.
[2023-03-20 18:35:58] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 227/227 places, 354/354 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1)), p1:(AND (OR (GEQ s64 1) (GEQ s131 1) (GEQ s129 1) (GEQ s66 1) (GEQ s68 1) (GEQ s135 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 622 ms.
Stack based approach found an accepted trace after 34622 steps with 0 reset with depth 34623 and stack size 17354 in 232 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 finished in 1583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 20 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 18:35:59] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-20 18:35:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 18:35:59] [INFO ] Invariant cache hit.
[2023-03-20 18:35:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 18:35:59] [INFO ] Invariant cache hit.
[2023-03-20 18:35:59] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (OR (LT s103 1) (LT s130 1)) (OR (LT s93 1) (LT s127 1)) (OR (LT s83 1) (LT s125 1)) (OR (LT s88 1) (LT s126 1)) (OR (LT s96 1) (LT s128 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))&&F(p2)&&p0)))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 14 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 18:35:59] [INFO ] Invariant cache hit.
[2023-03-20 18:35:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 18:35:59] [INFO ] Invariant cache hit.
[2023-03-20 18:36:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-20 18:36:00] [INFO ] Invariant cache hit.
[2023-03-20 18:36:00] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 155 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 18:36:00] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-20 18:36:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 18:36:00] [INFO ] Invariant cache hit.
[2023-03-20 18:36:00] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 18:36:00] [INFO ] Invariant cache hit.
[2023-03-20 18:36:00] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 227/227 places, 354/354 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s24 1) (LT s184 1)) (OR (LT s0 1) (LT s17 1) (LT s184 1)) (OR (LT s3 1) (LT s28 1) (LT s184 1)) (OR (LT s2 1) (LT s21 1) (LT s18...], 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 892 ms.
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 finished in 2444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 9 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 18:36:02] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 18:36:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 18:36:02] [INFO ] Invariant cache hit.
[2023-03-20 18:36:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-20 18:36:02] [INFO ] Invariant cache hit.
[2023-03-20 18:36:03] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s114 1) (LT s113 1) (LT s118 1) (LT s117 1) (LT s116 1) (LT s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 183 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 finished in 810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 5 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 18:36:03] [INFO ] Invariant cache hit.
[2023-03-20 18:36:03] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 18:36:03] [INFO ] Invariant cache hit.
[2023-03-20 18:36:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-20 18:36:03] [INFO ] Invariant cache hit.
[2023-03-20 18:36:03] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s24 1) (LT s112 1)) (OR (LT s0 1) (LT s17 1) (LT s112 1)) (OR (LT s3 1) (LT s28 1) (LT s112 1)) (OR (LT s2 1) (LT s21 1) (LT s11...], 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 50000 reset in 481 ms.
Product exploration explored 100000 steps with 50000 reset in 487 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 finished in 1399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 191 transition count 318
Applied a total of 72 rules in 25 ms. Remains 191 /227 variables (removed 36) and now considering 318/354 (removed 36) transitions.
// Phase 1: matrix 318 rows 191 cols
[2023-03-20 18:36:05] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:05] [INFO ] Implicit Places using invariants in 84 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/227 places, 318/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 190/227 places, 318/354 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 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:(OR (AND (LT s64 1) (LT s131 1) (LT s129 1) (LT s66 1) (LT s68 1) (LT s135 1) (LT s133 1) (LT s70 1) (LT s139 1) (LT s72 1) (LT s74 1) (LT s137 1) (LT ...], 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 1499 reset in 386 ms.
Stack based approach found an accepted trace after 70635 steps with 1048 reset with depth 102 and stack size 102 in 268 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 finished in 845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1&&X(p2)))))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 9 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 18:36:05] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 18:36:05] [INFO ] Invariant cache hit.
[2023-03-20 18:36:06] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-20 18:36:06] [INFO ] Invariant cache hit.
[2023-03-20 18:36:06] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (AND (LT s122 1) (LT s121 1) (LT s120 1) (LT s119 1) (LT s124 1) (LT s123 1)) (AND (OR (LT s105 1) (LT s124 1)) (OR (LT s85 1) (LT s119 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 21033 steps with 0 reset with depth 21034 and stack size 21034 in 48 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((G(F(!p1)) U G(!p2)))))'
Support contains 41 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 9 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 18:36:06] [INFO ] Invariant cache hit.
[2023-03-20 18:36:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 18:36:06] [INFO ] Invariant cache hit.
[2023-03-20 18:36:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-20 18:36:06] [INFO ] Invariant cache hit.
[2023-03-20 18:36:06] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 165 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (LT s1 1) (LT s24 1) (LT s112 1)) (OR (LT s0 1) (LT s17 1) (LT s112 1)) (OR (LT s3 1) (LT s28 1) (LT s112 1)) (OR (LT s2 1) (LT s21 1) (LT s11...], 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 14397 reset in 868 ms.
Product exploration explored 100000 steps with 14376 reset in 884 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 p0) (NOT p1)), (X (AND p0 p2)), (X (AND p0 p2 p1)), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 535 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p0 p2)), (X (AND p0 p2 p1)), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2))), (F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 p0 (NOT p2))), (F (NOT p2)), (F (AND p0 p2)), (F p0)]
Knowledge based reduction with 7 factoid took 657 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 148 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
[2023-03-20 18:36:10] [INFO ] Invariant cache hit.
[2023-03-20 18:36:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-20 18:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:36:11] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-20 18:36:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:36:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-20 18:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:36:11] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-20 18:36:11] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:36:12] [INFO ] Added : 188 causal constraints over 38 iterations in 712 ms. Result :sat
Could not prove EG p2
Support contains 41 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 18:36:12] [INFO ] Invariant cache hit.
[2023-03-20 18:36:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 18:36:12] [INFO ] Invariant cache hit.
[2023-03-20 18:36:12] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 18:36:12] [INFO ] Invariant cache hit.
[2023-03-20 18:36:12] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 155/155 places, 282/282 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 p2 (NOT p0) (NOT p1)), (X (AND p1 p0 p2)), (X (AND p0 p2)), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 515 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p1 p0 p2)), (X (AND p0 p2)), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (AND p0 p2)), (F p0)]
Knowledge based reduction with 7 factoid took 664 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 153 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
[2023-03-20 18:36:14] [INFO ] Invariant cache hit.
[2023-03-20 18:36:14] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-20 18:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:36:15] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-20 18:36:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:36:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-20 18:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:36:15] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-20 18:36:15] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:36:16] [INFO ] Added : 188 causal constraints over 38 iterations in 681 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 138 ms :[p2, (AND p2 p0 p1), (AND (NOT p2) p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 14456 reset in 940 ms.
Stack based approach found an accepted trace after 2478 steps with 351 reset with depth 8 and stack size 8 in 31 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 finished in 10840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(!p1)))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 7 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 18:36:17] [INFO ] Invariant cache hit.
[2023-03-20 18:36:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 18:36:17] [INFO ] Invariant cache hit.
[2023-03-20 18:36:17] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-20 18:36:17] [INFO ] Invariant cache hit.
[2023-03-20 18:36:17] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 214 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s114 1) (LT s113 1) (LT s118 1) (LT s117 1) (LT s116 1) (LT s115 1)), p1:(AND (OR (GEQ s114 1) (GEQ s113 1) (GEQ s118 1) (GEQ s117 1) (GEQ s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Product exploration explored 100000 steps with 50000 reset in 212 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 8 factoid took 144 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 1097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&((!p1 U !p2)||G(F(!p3))))))'
Support contains 48 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 128 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 128 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 110 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 110 transition count 144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 270 place count 104 transition count 138
Applied a total of 270 rules in 20 ms. Remains 104 /227 variables (removed 123) and now considering 138/354 (removed 216) transitions.
// Phase 1: matrix 138 rows 104 cols
[2023-03-20 18:36:18] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:18] [INFO ] Implicit Places using invariants in 42 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/227 places, 138/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 103/227 places, 138/354 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (AND p2 p3)), (NOT p0), (AND p2 p3), (AND p2 p3), (OR (AND (NOT p0) p3) (AND p2 p3)), (OR (AND (NOT p0) p3) (AND p2 p3)), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2 p1 p3), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 p3), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) (AND p2 p1)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p3) (AND p2 p1 p3)), acceptance={} source=4 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2 (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND p2 p1 p3)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p2) p3) (AND p0 (NOT p1) p3)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s77 1) (LT s90 1)) (OR (LT s57 1) (LT s85 1)) (OR (LT s67 1) (LT s88 1)) (OR (LT s62 1) (LT s87 1)) (OR (LT s60 1) (LT s86 1)) (OR (LT s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 997 reset in 373 ms.
Stack based approach found an accepted trace after 24422 steps with 247 reset with depth 266 and stack size 266 in 91 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 finished in 944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p2)||p1))||p0)))'
Support contains 132 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 18:36:19] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:19] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 18:36:19] [INFO ] Invariant cache hit.
[2023-03-20 18:36:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 18:36:19] [INFO ] Invariant cache hit.
[2023-03-20 18:36:19] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 227/227 places, 354/354 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s177 1) (GEQ s196 1)) (AND (GEQ s157 1) (GEQ s191 1)) (AND (GEQ s167 1) (GEQ s194 1)) (AND (GEQ s162 1) (GEQ s193 1)) (AND (GEQ s160 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 53 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 18:36:19] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p0)))&&X((p2 U (!p3||G(p2))))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), true, (AND (NOT p1) (NOT p0)), (AND p3 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s114 1) (GEQ s113 1) (GEQ s118 1) (GEQ s117 1) (GEQ s116 1) (GEQ s115 1))) (OR (AND (GEQ s105 1) (GEQ s124 1)) (AND (GEQ s85 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 24 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(((!p2 U (G(!p2)||(!p2&&G(!p3)))) U (G(!p2)||(G(p4)&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))))&&p1)))))'
Support contains 71 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Applied a total of 216 rules in 23 ms. Remains 131 /227 variables (removed 96) and now considering 234/354 (removed 120) transitions.
// Phase 1: matrix 234 rows 131 cols
[2023-03-20 18:36:20] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-20 18:36:20] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-20 18:36:20] [INFO ] Invariant cache hit.
[2023-03-20 18:36:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/227 places, 234/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 131/227 places, 234/354 transitions.
Stuttering acceptance computed with spot in 542 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p3), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p4)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND (NOT p0) p2 p3), false, false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2, 3} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p4 (NOT p3) p0), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={1, 3} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2, 3} source=0 dest: 2}, { cond=(AND p1 (NOT p2) p4 p3 p0), acceptance={1, 2} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p4 p3 (NOT p0)), acceptance={1, 2, 3} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p4 p0), acceptance={2} source=0 dest: 4}, { cond=(AND p1 (NOT p2) p4 (NOT p0)), acceptance={2, 3} source=0 dest: 4}], [{ cond=(AND p2 p3 p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p2 p3 (NOT p0)), acceptance={0, 1, 2, 3} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1, 3} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={1, 2, 3} source=1 dest: 3}, { cond=(AND p2 (NOT p3) p0), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1, 3} source=1 dest: 5}], [{ cond=(AND p2 p0), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2, 3} source=2 dest: 0}, { cond=(AND (NOT p2) p4 (NOT p3) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={1, 3} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p4) p0), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2, 3} source=2 dest: 2}, { cond=(AND (NOT p2) p4 p3 p0), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p2) p4 p3 (NOT p0)), acceptance={1, 2, 3} source=2 dest: 3}, { cond=(AND (NOT p2) p4 p0), acceptance={2} source=2 dest: 4}, { cond=(AND (NOT p2) p4 (NOT p0)), acceptance={2, 3} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2, 3} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1, 3} source=3 dest: 1}, { cond=(AND (NOT p2) p3 p0), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={1, 2, 3} source=3 dest: 3}], [{ cond=(AND p2 (NOT p4) p0), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p0)), acceptance={0, 1, 2, 3} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p4) p0), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p2) p4 p0), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p2) p4 (NOT p0)), acceptance={2, 3} source=4 dest: 4}, { cond=(AND p2 p4 p0), acceptance={0, 2} source=4 dest: 6}, { cond=(AND p2 p4 (NOT p0)), acceptance={0, 2, 3} source=4 dest: 6}], [{ cond=(OR (AND (NOT p1) p3 p0) (AND p2 p3 p0)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND p2 p3 (NOT p0))), acceptance={0, 1, 2, 3} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p4 (NOT p3) p0), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={1, 3} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p4) p3 p0), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) p3 (NOT p0)), acceptance={1, 2, 3} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p4 p3 p0), acceptance={1, 2} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p4 p3 (NOT p0)), acceptance={1, 2, 3} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p4 p3 p0), acceptance={2} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p4 p3 (NOT p0)), acceptance={2, 3} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p3) p0) (AND p2 (NOT p3) p0)), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))), acceptance={0, 1, 3} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p3) p0), acceptance={1} source=5 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p3) (NOT p0)), acceptance={1, 3} source=5 dest: 7}, { cond=(AND p1 (NOT p2) p4 (NOT p3) p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={3} source=5 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p4) p0) (AND p2 (NOT p4) p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND p2 (NOT p4) (NOT p0))), acceptance={0, 1, 2, 3} source=6 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={1, 2} source=6 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2, 3} source=6 dest: 2}, { cond=(AND p1 (NOT p2) p4 p0), acceptance={2} source=6 dest: 4}, { cond=(AND p1 (NOT p2) p4 (NOT p0)), acceptance={2, 3} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p4 p0) (AND p2 p4 p0)), acceptance={0, 2} source=6 dest: 6}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND p2 p4 (NOT p0))), acceptance={0, 2, 3} source=6 dest: 6}], [{ cond=(AND p2 p3 p0), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND p2 p3 (NOT p0)), acceptance={0, 1, 2, 3} source=7 dest: 0}, { cond=(AND (NOT p2) p4 (NOT p3) p0), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={1, 3} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p4) p3 p0), acceptance={1, 2} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p4) p3 (NOT p0)), acceptance={1, 2, 3} source=7 dest: 2}, { cond=(AND (NOT p2) p4 p3 p0), acceptance={1, 2} source=7 dest: 3}, { cond=(AND (NOT p2) p4 p3 (NOT p0)), acceptance={1, 2, 3} source=7 dest: 3}, { cond=(AND (NOT p2) p4 p3 p0), acceptance={2} source=7 dest: 4}, { cond=(AND (NOT p2) p4 p3 (NOT p0)), acceptance={2, 3} source=7 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1, 3} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p0), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p0)), acceptance={1, 3} source=7 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p3) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={3} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p4) p3 p0), acceptance={1, 2} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p4) p3 (NOT p0)), acceptance={1, 2, 3} source=8 dest: 2}, { cond=(AND (NOT p2) p4 p3 p0), acceptance={2} source=8 dest: 4}, { cond=(AND (NOT p2) p4 p3 (NOT p0)), acceptance={2, 3} source=8 dest: 4}, { cond=(AND p2 p4 p3 p0), acceptance={0, 2} source=8 dest: 6}, { cond=(AND p2 p4 p3 (NOT p0)), acceptance={0, 2, 3} source=8 dest: 6}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p0), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p0)), acceptance={1, 3} source=8 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p0)), acceptance={3} source=8 dest: 8}, { cond=(AND p2 p4 (NOT p3) p0), acceptance={0} source=8 dest: 9}, { cond=(AND p2 p4 (NOT p3) (NOT p0)), acceptance={0, 3} source=8 dest: 9}], [{ cond=(OR (AND (NOT p1) p4 p3 p0) (AND p2 p4 p3 p0)), acceptance={0, 2} source=9 dest: 6}, { cond=(OR (AND (NOT p1) p4 p3 (NOT p0)) (AND p2 p4 p3 (NOT p0))), acceptance={0, 2, 3} source=9 dest: 6}, { cond=(OR (AND (NOT p1) p4 (NOT p3) p0) (AND p2 p4 (NOT p3) p0)), acceptance={0} source=9 dest: 9}, { cond=(OR (AND (NOT p1) p4 (NOT p3) (NOT p0)) (AND p2 p4 (NOT p3) (NOT p0))), acceptance={0, 3} source=9 dest: 9}]], initial=0, aps=[p1:(AND (OR (LT s1 1) (LT s24 1) (LT s88 1)) (OR (LT s0 1) (LT s17 1) (LT s88 1)) (OR (LT s3 1) (LT s28 1) (LT s88 1)) (OR (LT s2 1) (LT s21 1) (LT s88 1)...], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3209 ms.
Stack based approach found an accepted trace after 47629 steps with 0 reset with depth 47630 and stack size 34355 in 1582 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 finished in 5622 ms.
All properties solved by simple procedures.
Total runtime 31182 ms.
ITS solved all properties within timeout

BK_STOP 1679337387283

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-Z4T4N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T4N06, 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 r489-tall-167912707601068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N06.tgz
mv UtilityControlRoom-COL-Z4T4N06 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 ;