fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r487-tall-167912704101220
Last Updated
May 14, 2023

About the Execution of LoLa+red for UtilityControlRoom-PT-Z4T4N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1392.348 96575.00 114822.00 804.50 FFTTFFFFFFTF?FF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912704101220.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 lolaxred
Input is UtilityControlRoom-PT-Z4T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912704101220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 55K Feb 26 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 271K Feb 26 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 525K Feb 26 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 329K Feb 26 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 141K Feb 26 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 477K Feb 26 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 319K 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-PT-Z4T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679241885918

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:04:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:04:47] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-19 16:04:47] [INFO ] Transformed 376 places.
[2023-03-19 16:04:47] [INFO ] Transformed 750 transitions.
[2023-03-19 16:04:47] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-19 16:04:47] [INFO ] Reduced 30 identical enabling conditions.
[2023-03-19 16:04:47] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 26 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-19 16:04:48] [INFO ] Computed 23 place invariants in 31 ms
[2023-03-19 16:04:48] [INFO ] Implicit Places using invariants in 233 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 484 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 517 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2023-03-19 16:04:48] [INFO ] Flatten gal took : 84 ms
[2023-03-19 16:04:48] [INFO ] Flatten gal took : 62 ms
[2023-03-19 16:04:48] [INFO ] Input system was already deterministic with 590 transitions.
Finished random walk after 7200 steps, including 2 resets, run visited all 27 properties in 276 ms. (steps per millisecond=26 )
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' '!((!p0 U X((G(p1) U !p0))))'
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 32 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:04:49] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 16:04:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-19 16:04:49] [INFO ] Invariant cache hit.
[2023-03-19 16:04:49] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-19 16:04:49] [INFO ] Invariant cache hit.
[2023-03-19 16:04:50] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 271 ms :[p0, p0, p0, true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s174 1) (GEQ s175 1) (GEQ s180 1) (GEQ s181 1) (GEQ s182 1) (GEQ s183 1) (GEQ s176 1) (GEQ s177 1) (GEQ s178 1) (GEQ s179 1)), p1:(OR (GEQ s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-00 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 14 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2023-03-19 16:04:50] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 16:04:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 16:04:50] [INFO ] Invariant cache hit.
[2023-03-19 16:04:50] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-19 16:04:50] [INFO ] Invariant cache hit.
[2023-03-19 16:04:51] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s258 1) (LT s326 1)) (OR (LT s278 1) (LT s331 1)) (OR (LT s283 1) (LT s332 1)) (OR (LT s282 1) (LT s332 1)) (OR (LT s262 1) (LT s327 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Product exploration explored 100000 steps with 50000 reset in 315 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 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-02 finished in 1554 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 p1)||X(!p0)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 14 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:04:52] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 16:04:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 16:04:52] [INFO ] Invariant cache hit.
[2023-03-19 16:04:52] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-19 16:04:52] [INFO ] Invariant cache hit.
[2023-03-19 16:04:52] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s187 1) (GEQ s188 1) (GEQ s190 1) (GEQ s189 1) (GEQ s185 1) (GEQ s186 1) (GEQ s192 1) (GEQ s191 1) (GEQ s194 1) (GEQ s193 1)), p0:(OR (AND (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 734 ms.
Product exploration explored 100000 steps with 50000 reset in 704 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1)))]
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) p0)))
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-03 finished in 2127 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)||(!p0&&F(!p1))))))'
Support contains 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 15 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-19 16:04:54] [INFO ] Invariant cache hit.
[2023-03-19 16:04:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 16:04:54] [INFO ] Invariant cache hit.
[2023-03-19 16:04:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-19 16:04:54] [INFO ] Invariant cache hit.
[2023-03-19 16:04:54] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1)), p0:(OR (AND (GEQ s137 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2324 reset in 405 ms.
Product exploration explored 100000 steps with 2291 reset in 458 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 (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 181 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 16:04:56] [INFO ] Invariant cache hit.
[2023-03-19 16:04:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 16:04:56] [INFO ] Invariant cache hit.
[2023-03-19 16:04:56] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-19 16:04:56] [INFO ] Invariant cache hit.
[2023-03-19 16:04:57] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 255/255 places, 470/470 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 156 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 178 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 2322 reset in 400 ms.
Product exploration explored 100000 steps with 2320 reset in 407 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 255 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 130 place count 255 transition count 460
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 252 transition count 340
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 252 transition count 340
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 166 place count 222 transition count 310
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 196 place count 222 transition count 310
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 196 rules in 47 ms. Remains 222 /255 variables (removed 33) and now considering 310/470 (removed 160) transitions.
[2023-03-19 16:04:59] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2023-03-19 16:04:59] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 16:04:59] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/255 places, 310/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 222/255 places, 310/470 transitions.
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:04:59] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-19 16:04:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 16:04:59] [INFO ] Invariant cache hit.
[2023-03-19 16:04:59] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 16:04:59] [INFO ] Invariant cache hit.
[2023-03-19 16:04:59] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-04 finished in 5784 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 U !p1))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 315 transition count 530
Applied a total of 120 rules in 25 ms. Remains 315 /375 variables (removed 60) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 315 cols
[2023-03-19 16:04:59] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 16:05:00] [INFO ] Implicit Places using invariants in 139 ms returned [294]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/375 places, 530/590 transitions.
Applied a total of 0 rules in 10 ms. Remains 314 /314 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 314/375 places, 530/590 transitions.
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s257 1) (GEQ s294 1)) (AND (GEQ s262 1) (GEQ s296 1)) (AND (GEQ s272 1) (GEQ s298 1)) (AND (GEQ s282 1) (GEQ s301 1)) (AND (GEQ s287 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 842 reset in 642 ms.
Stack based approach found an accepted trace after 8621 steps with 46 reset with depth 410 and stack size 410 in 55 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-05 finished in 958 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||(p1&&X(X(G(!p2)))))))'
Support contains 135 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:05:00] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-19 16:05:00] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:05:00] [INFO ] Invariant cache hit.
[2023-03-19 16:05:01] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-19 16:05:01] [INFO ] Invariant cache hit.
[2023-03-19 16:05:01] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR p2 (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (LT s2 1) (LT s40 1) (LT s184 1)) (OR (LT s0 1) (LT s26 1) (LT s184 1)) (OR (LT s1 1) (LT s43 1) (LT s184 1)) (OR (LT s2 1) (LT s20 1) (LT s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-07 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&X(F(p2)))))))'
Support contains 4 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 256 transition count 471
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 256 transition count 471
Applied a total of 238 rules in 10 ms. Remains 256 /375 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 256 cols
[2023-03-19 16:05:01] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-19 16:05:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 16:05:01] [INFO ] Invariant cache hit.
[2023-03-19 16:05:01] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-19 16:05:01] [INFO ] Invariant cache hit.
[2023-03-19 16:05:01] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/375 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 256/375 places, 471/590 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s199 1), p1:(GEQ s118 1), p2:(OR (AND (GEQ s163 1) (GEQ s213 1)) (LT s199 1))], 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 53 reset in 288 ms.
Product exploration explored 100000 steps with 70 reset in 297 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) p2), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 332 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:05:03] [INFO ] Invariant cache hit.
[2023-03-19 16:05:03] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-19 16:05:03] [INFO ] Invariant cache hit.
[2023-03-19 16:05:03] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned unsat
Proved EG (AND (NOT p1) (NOT p0))
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-08 finished in 2789 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 X(G(p1)))))'
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:05:04] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-19 16:05:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-19 16:05:04] [INFO ] Invariant cache hit.
[2023-03-19 16:05:04] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-19 16:05:04] [INFO ] Invariant cache hit.
[2023-03-19 16:05:04] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s72 1), p0:(GEQ s192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-09 finished in 611 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(p1)||p0) U X(!p1)))'
Support contains 4 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 118 place count 257 transition count 472
Iterating global reduction 0 with 118 rules applied. Total rules applied 236 place count 257 transition count 472
Applied a total of 236 rules in 7 ms. Remains 257 /375 variables (removed 118) and now considering 472/590 (removed 118) transitions.
// Phase 1: matrix 472 rows 257 cols
[2023-03-19 16:05:04] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 16:05:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-19 16:05:04] [INFO ] Invariant cache hit.
[2023-03-19 16:05:05] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-19 16:05:05] [INFO ] Invariant cache hit.
[2023-03-19 16:05:05] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 257/375 places, 472/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 257/375 places, 472/590 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, p1, true, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s114 1) (LT s127 1) (AND (GEQ s153 1) (GEQ s211 1))), p1:(GEQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 193 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 p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-10 finished in 1094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(!p1&&F(p0))))))'
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 10 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:05:05] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 16:05:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-19 16:05:06] [INFO ] Invariant cache hit.
[2023-03-19 16:05:06] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-19 16:05:06] [INFO ] Invariant cache hit.
[2023-03-19 16:05:06] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s191 1) (AND (GEQ s168 1) (GEQ s203 1))), p0:(AND (GEQ s1 1) (GEQ s39 1) (GEQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 242 reset in 246 ms.
Product exploration explored 100000 steps with 273 reset in 268 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 p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-19 16:05:07] [INFO ] Invariant cache hit.
[2023-03-19 16:05:07] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-19 16:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:05:07] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-19 16:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:05:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 16:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:05:08] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-19 16:05:08] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-19 16:05:11] [INFO ] Added : 416 causal constraints over 84 iterations in 2580 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 255 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 : 255/255 places, 470/470 transitions.
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 39 Pre rules applied. Total rules applied 0 place count 255 transition count 431
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 216 transition count 431
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 0 with 152 rules applied. Total rules applied 230 place count 140 transition count 355
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 270 place count 140 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 272 place count 138 transition count 235
Iterating global reduction 1 with 2 rules applied. Total rules applied 274 place count 138 transition count 235
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 293 place count 119 transition count 199
Iterating global reduction 1 with 19 rules applied. Total rules applied 312 place count 119 transition count 199
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 331 place count 100 transition count 161
Iterating global reduction 1 with 19 rules applied. Total rules applied 350 place count 100 transition count 161
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 367 place count 100 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 369 place count 98 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 98 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 373 place count 98 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 375 place count 97 transition count 137
Applied a total of 375 rules in 32 ms. Remains 97 /255 variables (removed 158) and now considering 137/470 (removed 333) transitions.
// Phase 1: matrix 137 rows 97 cols
[2023-03-19 16:05:11] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-19 16:05:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 16:05:11] [INFO ] Invariant cache hit.
[2023-03-19 16:05:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-19 16:05:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:05:11] [INFO ] Invariant cache hit.
[2023-03-19 16:05:11] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/255 places, 137/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 97/255 places, 137/470 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 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
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 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 16:05:11] [INFO ] Invariant cache hit.
[2023-03-19 16:05:11] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-19 16:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:05:11] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-19 16:05:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:05:11] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-19 16:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:05:11] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-19 16:05:11] [INFO ] Computed and/alt/rep : 115/260/115 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-19 16:05:12] [INFO ] Added : 104 causal constraints over 22 iterations in 284 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1172 reset in 222 ms.
Stack based approach found an accepted trace after 4626 steps with 57 reset with depth 22 and stack size 22 in 11 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-11 finished in 6560 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((X((p0||(F(p2)&&p1)))||F(p3)))))'
Support contains 7 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 360 place count 215 transition count 352
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 436 place count 177 transition count 352
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 438 place count 175 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 440 place count 175 transition count 272
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 460 place count 155 transition count 252
Iterating global reduction 2 with 20 rules applied. Total rules applied 480 place count 155 transition count 252
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 499 place count 136 transition count 214
Iterating global reduction 2 with 19 rules applied. Total rules applied 518 place count 136 transition count 214
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 537 place count 117 transition count 176
Iterating global reduction 2 with 19 rules applied. Total rules applied 556 place count 117 transition count 176
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 575 place count 117 transition count 157
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 613 place count 98 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 615 place count 97 transition count 137
Applied a total of 615 rules in 33 ms. Remains 97 /375 variables (removed 278) and now considering 137/590 (removed 453) transitions.
// Phase 1: matrix 137 rows 97 cols
[2023-03-19 16:05:12] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-19 16:05:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:05:12] [INFO ] Invariant cache hit.
[2023-03-19 16:05:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-19 16:05:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:05:12] [INFO ] Invariant cache hit.
[2023-03-19 16:05:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/375 places, 137/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 97/375 places, 137/590 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (LT s54 1) (LT s71 1)), p0:(AND (GEQ s1 1) (GEQ s29 1) (GEQ s56 1)), p1:(AND (GEQ s53 1) (GEQ s68 1)), p2:(AND (GEQ s53 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 75 reset in 235 ms.
Product exploration explored 100000 steps with 87 reset in 242 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 p3 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 410 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-19 16:05:14] [INFO ] Invariant cache hit.
[2023-03-19 16:05:14] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (OR (AND p0 (NOT p3)) (AND (NOT p3) p1)))]
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 7 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-19 16:05:14] [INFO ] Invariant cache hit.
[2023-03-19 16:05:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:05:14] [INFO ] Invariant cache hit.
[2023-03-19 16:05:14] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 16:05:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:05:14] [INFO ] Invariant cache hit.
[2023-03-19 16:05:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 97/97 places, 137/137 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 p0) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 416 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 8019 steps, including 2 resets, run visited all 2 properties in 32 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p0))), (F (OR (AND p1 (NOT p3)) (AND (NOT p3) p0)))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 64 reset in 240 ms.
Product exploration explored 100000 steps with 82 reset in 255 ms.
Support contains 7 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-19 16:05:16] [INFO ] Invariant cache hit.
[2023-03-19 16:05:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 16:05:16] [INFO ] Invariant cache hit.
[2023-03-19 16:05:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-19 16:05:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:05:16] [INFO ] Invariant cache hit.
[2023-03-19 16:05:16] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 97/97 places, 137/137 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 finished in 4308 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&&X(p1)))&&G(F(p2))))'
Support contains 3 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 13 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:05:16] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-19 16:05:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-19 16:05:16] [INFO ] Invariant cache hit.
[2023-03-19 16:05:17] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-19 16:05:17] [INFO ] Invariant cache hit.
[2023-03-19 16:05:17] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s75 1), p2:(GEQ s72 1), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 89 reset in 269 ms.
Product exploration explored 100000 steps with 94 reset in 284 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 p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 313 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 406 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F p2)]
Knowledge based reduction with 8 factoid took 440 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-19 16:05:19] [INFO ] Invariant cache hit.
[2023-03-19 16:05:19] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned unsat
Proved EG (NOT p0)
[2023-03-19 16:05:19] [INFO ] Invariant cache hit.
[2023-03-19 16:05:19] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F p2), (G (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-13 finished in 3128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||X(X(F(p2)))))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 15 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-19 16:05:19] [INFO ] Invariant cache hit.
[2023-03-19 16:05:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 16:05:20] [INFO ] Invariant cache hit.
[2023-03-19 16:05:20] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-19 16:05:20] [INFO ] Invariant cache hit.
[2023-03-19 16:05:20] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s190 1), p2:(AND (GEQ s1 1) (GEQ s45 1) (GEQ s184 1)), p0:(OR (LT s1 1) (LT s25 1) (LT s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1353 reset in 259 ms.
Product exploration explored 100000 steps with 1340 reset in 268 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 p1) (NOT p2) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 16:05:22] [INFO ] Invariant cache hit.
[2023-03-19 16:05:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 16:05:22] [INFO ] Invariant cache hit.
[2023-03-19 16:05:22] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-19 16:05:22] [INFO ] Invariant cache hit.
[2023-03-19 16:05:22] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 255/255 places, 470/470 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 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))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 157 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT 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))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1369 reset in 253 ms.
Product exploration explored 100000 steps with 1372 reset in 262 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 0 with 75 rules applied. Total rules applied 115 place count 255 transition count 534
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 155 place count 255 transition count 494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 253 transition count 414
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 253 transition count 414
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 215 place count 197 transition count 322
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 271 place count 197 transition count 322
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 309 place count 159 transition count 264
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 347 place count 159 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 377 place count 159 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 381 place count 155 transition count 228
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 385 place count 155 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 389 place count 155 transition count 224
Deduced a syphon composed of 57 places in 1 ms
Applied a total of 389 rules in 34 ms. Remains 155 /255 variables (removed 100) and now considering 224/470 (removed 246) transitions.
[2023-03-19 16:05:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 224 rows 155 cols
[2023-03-19 16:05:24] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-19 16:05:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/255 places, 224/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 155/255 places, 224/470 transitions.
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 16:05:24] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 16:05:24] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 16:05:24] [INFO ] Invariant cache hit.
[2023-03-19 16:05:24] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-19 16:05:24] [INFO ] Invariant cache hit.
[2023-03-19 16:05:24] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 finished in 5089 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)||(!p0&&F(!p1))))))'
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((X((p0||(F(p2)&&p1)))||F(p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||X(X(F(p2)))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-15
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 442 place count 173 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 444 place count 173 transition count 270
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 464 place count 153 transition count 250
Iterating global reduction 2 with 20 rules applied. Total rules applied 484 place count 153 transition count 250
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 504 place count 133 transition count 210
Iterating global reduction 2 with 20 rules applied. Total rules applied 524 place count 133 transition count 210
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 542 place count 115 transition count 174
Iterating global reduction 2 with 18 rules applied. Total rules applied 560 place count 115 transition count 174
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 578 place count 115 transition count 156
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 612 place count 98 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 616 place count 96 transition count 137
Applied a total of 616 rules in 30 ms. Remains 96 /375 variables (removed 279) and now considering 137/590 (removed 453) transitions.
// Phase 1: matrix 137 rows 96 cols
[2023-03-19 16:05:25] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 16:05:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 16:05:25] [INFO ] Invariant cache hit.
[2023-03-19 16:05:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 16:05:25] [INFO ] Invariant cache hit.
[2023-03-19 16:05:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/375 places, 137/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 225 ms. Remains : 96/375 places, 137/590 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s60 1), p2:(AND (GEQ s1 1) (GEQ s27 1) (GEQ s54 1)), p0:(OR (LT s1 1) (LT s16 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2499 reset in 236 ms.
Stack based approach found an accepted trace after 5725 steps with 137 reset with depth 80 and stack size 80 in 15 ms.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 finished in 972 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 16:05:26] [INFO ] Flatten gal took : 29 ms
[2023-03-19 16:05:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 16:05:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 375 places, 590 transitions and 1720 arcs took 4 ms.
Total runtime 38793 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT UtilityControlRoom-PT-Z4T4N10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA UtilityControlRoom-PT-Z4T4N10-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679241982493

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 UtilityControlRoom-PT-Z4T4N10-LTLFireability-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for UtilityControlRoom-PT-Z4T4N10-LTLFireability-04
lola: result : false
lola: markings : 24
lola: fired transitions : 28
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 UtilityControlRoom-PT-Z4T4N10-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 9/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 1003120 m, 200624 m/sec, 1545840 t fired, .

Time elapsed: 5 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 18/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 2019594 m, 203294 m/sec, 3120127 t fired, .

Time elapsed: 10 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 26/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 3031531 m, 202387 m/sec, 4644978 t fired, .

Time elapsed: 15 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for UtilityControlRoom-PT-Z4T4N10-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15
lola: time limit : 3580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3580 6/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 763552 m, 152710 m/sec, 1576354 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3580 11/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 1429869 m, 133263 m/sec, 3169154 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3580 16/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 2062751 m, 126576 m/sec, 4804543 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3580 21/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 2700359 m, 127521 m/sec, 6335351 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/3580 25/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 3276465 m, 115221 m/sec, 8014602 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/3580 30/32 UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 3894667 m, 123640 m/sec, 9717288 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for UtilityControlRoom-PT-Z4T4N10-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-PT-Z4T4N10-LTLFireability-04: LTL false LTL model checker
UtilityControlRoom-PT-Z4T4N10-LTLFireability-12: LTL unknown AGGR
UtilityControlRoom-PT-Z4T4N10-LTLFireability-15: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

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-PT-Z4T4N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is UtilityControlRoom-PT-Z4T4N10, 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 r487-tall-167912704101220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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