Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 45K Feb 26 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 215K Feb 26 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K Feb 26 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 116K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 556K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 174K Feb 26 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 639K Feb 26 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 17:25 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-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679342031834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 19:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:53:53] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-20 19:53:53] [INFO ] Transformed 376 places.
[2023-03-20 19:53:53] [INFO ] Transformed 750 transitions.
[2023-03-20 19:53:53] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 307 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 16 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-20 19:53:53] [INFO ] Computed 23 place invariants in 33 ms
[2023-03-20 19:53:54] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-20 19:53:54] [INFO ] Invariant cache hit.
[2023-03-20 19:53:54] [INFO ] Implicit Places using invariants and state equation in 354 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 803 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 8 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 827 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 307 out of 375 places after structural reductions.
[2023-03-20 19:53:54] [INFO ] Flatten gal took : 71 ms
[2023-03-20 19:53:54] [INFO ] Flatten gal took : 44 ms
[2023-03-20 19:53:54] [INFO ] Input system was already deterministic with 590 transitions.
Finished random walk after 4251 steps, including 1 resets, run visited all 21 properties in 137 ms. (steps per millisecond=31 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 50 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-20 19:53:55] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-20 19:53:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-20 19:53:55] [INFO ] Invariant cache hit.
[2023-03-20 19:53:55] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-20 19:53:55] [INFO ] Invariant cache hit.
[2023-03-20 19:53:56] [INFO ] Dead Transitions using invariants and state equation in 188 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 508 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s137 1) (LT s195 1)) (OR (LT s142 1) (LT s197 1)) (OR (LT s152 1) (LT s199 1)) (OR (LT s162 1) (LT s202 1)) (OR (LT s167 1) (LT s203 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 160 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 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 375 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
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 200 place count 275 transition count 490
Applied a total of 200 rules in 47 ms. Remains 275 /375 variables (removed 100) and now considering 490/590 (removed 100) transitions.
// Phase 1: matrix 490 rows 275 cols
[2023-03-20 19:53:56] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-20 19:53:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-20 19:53:56] [INFO ] Invariant cache hit.
[2023-03-20 19:53:56] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-20 19:53:56] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-20 19:53:56] [INFO ] Invariant cache hit.
[2023-03-20 19:53:56] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/375 places, 490/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 275/375 places, 490/590 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s131 1) (LT s192 1) (LT s135 1) (LT s196 1) (LT s139 1) (LT s200 1) (LT s143 1) (LT s204 1) (LT s147 1) (LT s208 1) (LT s151 1) (LT s212 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2905 reset in 758 ms.
Stack based approach found an accepted trace after 1274 steps with 36 reset with depth 87 and stack size 87 in 10 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 1445 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&&X(X(p2))))))||G(!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 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-20 19:53:57] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-20 19:53:57] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-20 19:53:57] [INFO ] Invariant cache hit.
[2023-03-20 19:53:58] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-20 19:53:58] [INFO ] Invariant cache hit.
[2023-03-20 19:53:58] [INFO ] Dead Transitions using invariants and state equation in 179 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 524 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 503 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}, { cond=p0, acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=2, aps=[p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5901 reset in 534 ms.
Product exploration explored 100000 steps with 5872 reset in 525 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 (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 604 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 46 steps, including 0 resets, run visited all 11 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F p0), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 664 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
[2023-03-20 19:54:02] [INFO ] Invariant cache hit.
[2023-03-20 19:54:02] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-20 19:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:02] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-20 19:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:54:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-20 19:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:02] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-20 19:54:03] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-20 19:54:03] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-20 19:54:03] [INFO ] Invariant cache hit.
[2023-03-20 19:54:03] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-20 19:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:03] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-20 19:54:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:54:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-20 19:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:03] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-20 19:54:03] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-20 19:54:03] [INFO ] Added : 23 causal constraints over 5 iterations in 192 ms. Result :sat
Could not prove EG (NOT 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 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 19:54:03] [INFO ] Invariant cache hit.
[2023-03-20 19:54:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 19:54:04] [INFO ] Invariant cache hit.
[2023-03-20 19:54:04] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-20 19:54:04] [INFO ] Invariant cache hit.
[2023-03-20 19:54:04] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 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 p0) p1), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 11 properties in 8 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F p0), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 660 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 394 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
[2023-03-20 19:54:06] [INFO ] Invariant cache hit.
[2023-03-20 19:54:06] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2023-03-20 19:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:06] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-20 19:54:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:54:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2023-03-20 19:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:07] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-20 19:54:07] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-20 19:54:07] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-20 19:54:07] [INFO ] Invariant cache hit.
[2023-03-20 19:54:07] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-20 19:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:07] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-20 19:54:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:54:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-20 19:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:54:07] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-20 19:54:08] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-20 19:54:08] [INFO ] Added : 23 causal constraints over 5 iterations in 190 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5843 reset in 425 ms.
Product exploration explored 100000 steps with 5823 reset in 484 ms.
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 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 19:54:09] [INFO ] Invariant cache hit.
[2023-03-20 19:54:09] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 19:54:09] [INFO ] Invariant cache hit.
[2023-03-20 19:54:09] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-20 19:54:09] [INFO ] Invariant cache hit.
[2023-03-20 19:54:10] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 12495 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))))'
Support contains 160 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 2 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2023-03-20 19:54:10] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-20 19:54:10] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-20 19:54:10] [INFO ] Invariant cache hit.
[2023-03-20 19:54:10] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-20 19:54:10] [INFO ] Invariant cache hit.
[2023-03-20 19:54:10] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s131 1) (LT s192 1) (LT s135 1) (LT s196 1) (LT s139 1) (LT s200 1) (LT s143 1) (LT s204 1) (LT s147 1) (LT s208 1) (LT s151 1) (LT s212 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 finished in 744 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&&F(p1))))'
Support contains 55 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 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
Applied a total of 440 rules in 27 ms. Remains 175 /375 variables (removed 200) and now considering 350/590 (removed 240) transitions.
// Phase 1: matrix 350 rows 175 cols
[2023-03-20 19:54:10] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-20 19:54:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 19:54:11] [INFO ] Invariant cache hit.
[2023-03-20 19:54:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-20 19:54:11] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 19:54:11] [INFO ] Invariant cache hit.
[2023-03-20 19:54:11] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/375 places, 350/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 175/375 places, 350/590 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s124 1) (GEQ s123 1) (GEQ s120 1) (GEQ s119 1) (GEQ s122 1) (GEQ s121 1) (GEQ s116 1) (GEQ s115 1) (GEQ s118 1) (GEQ s117 1)), p0:(OR (AND (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 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 p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (AND p1 (NOT p0)))
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1||X((G(p2) U (p1&&G(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 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-20 19:54:12] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-20 19:54:12] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 19:54:12] [INFO ] Invariant cache hit.
[2023-03-20 19:54:12] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-20 19:54:12] [INFO ] Invariant cache hit.
[2023-03-20 19:54:12] [INFO ] Dead Transitions using invariants and state equation in 183 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 467 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(NOT p2), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0 p2), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(LT s63 1), p1:(GEQ s203 1), p2:(AND (GEQ s2 1) (GEQ s24 1) (GEQ s184 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 834 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||X((X(G(p1))&&F(p2)))))))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 375 transition count 432
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 355 place count 217 transition count 393
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 355 place count 217 transition count 353
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 435 place count 177 transition count 353
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 513 place count 138 transition count 314
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 2 with 2 rules applied. Total rules applied 515 place count 137 transition count 313
Applied a total of 515 rules in 34 ms. Remains 137 /375 variables (removed 238) and now considering 313/590 (removed 277) transitions.
// Phase 1: matrix 313 rows 137 cols
[2023-03-20 19:54:13] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-20 19:54:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 19:54:13] [INFO ] Invariant cache hit.
[2023-03-20 19:54:13] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 19:54:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 19:54:13] [INFO ] Invariant cache hit.
[2023-03-20 19:54:13] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/375 places, 313/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 137/375 places, 313/590 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s93 1), p2:(GEQ s94 1), p1:(OR (LT s0 1) (LT s29 1) (LT s96 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 97 reset in 414 ms.
Stack based approach found an accepted trace after 20097 steps with 16 reset with depth 1759 and stack size 1759 in 90 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 1089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
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 41 ms. Remains 97 /375 variables (removed 278) and now considering 137/590 (removed 453) transitions.
// Phase 1: matrix 137 rows 97 cols
[2023-03-20 19:54:14] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-20 19:54:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 19:54:14] [INFO ] Invariant cache hit.
[2023-03-20 19:54:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-20 19:54:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 19:54:14] [INFO ] Invariant cache hit.
[2023-03-20 19:54:14] [INFO ] Dead Transitions using invariants and state equation in 59 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 231 ms. Remains : 97/375 places, 137/590 transitions.
Stuttering acceptance computed with spot in 68 ms :[p1, true, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s53 1) (GEQ s74 1)), p0:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s56 1)) (AND (GEQ s54 1) (GEQ s76 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1744 steps with 0 reset in 7 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 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 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 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 543 place count 114 transition count 172
Iterating global reduction 2 with 19 rules applied. Total rules applied 562 place count 114 transition count 172
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 581 place count 114 transition count 153
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 619 place count 95 transition count 134
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 621 place count 94 transition count 133
Applied a total of 621 rules in 34 ms. Remains 94 /375 variables (removed 281) and now considering 133/590 (removed 457) transitions.
// Phase 1: matrix 133 rows 94 cols
[2023-03-20 19:54:14] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-20 19:54:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 19:54:14] [INFO ] Invariant cache hit.
[2023-03-20 19:54:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-20 19:54:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 19:54:14] [INFO ] Invariant cache hit.
[2023-03-20 19:54:14] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/375 places, 133/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 94/375 places, 133/590 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s25 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 722 reset in 248 ms.
Stack based approach found an accepted trace after 7261 steps with 45 reset with depth 199 and stack size 199 in 20 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (p1||G(p0)))))))'
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 15 ms. Remains 256 /375 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 256 cols
[2023-03-20 19:54:14] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-20 19:54:15] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-20 19:54:15] [INFO ] Invariant cache hit.
[2023-03-20 19:54:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 19:54:15] [INFO ] Invariant cache hit.
[2023-03-20 19:54:15] [INFO ] Dead Transitions using invariants and state equation in 162 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 465 ms. Remains : 256/375 places, 471/590 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s2 1) (GEQ s32 1) (GEQ s185 1))) (GEQ s106 1)), p0:(GEQ s106 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 327 ms.
Product exploration explored 100000 steps with 58 reset in 345 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 (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 19:54:16] [INFO ] Invariant cache hit.
[2023-03-20 19:54:16] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-20 19:54:16] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:54:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-20 19:54:16] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:54:16] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-20 19:54:16] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 19:54:17] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 2660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 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 17 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-20 19:54:17] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-20 19:54:17] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-20 19:54:17] [INFO ] Invariant cache hit.
[2023-03-20 19:54:17] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-20 19:54:17] [INFO ] Invariant cache hit.
[2023-03-20 19:54:18] [INFO ] Dead Transitions using invariants and state equation in 164 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 510 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 1112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 7 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 8 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 19:54:18] [INFO ] Invariant cache hit.
[2023-03-20 19:54:18] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 19:54:18] [INFO ] Invariant cache hit.
[2023-03-20 19:54:18] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-20 19:54:18] [INFO ] Invariant cache hit.
[2023-03-20 19:54:19] [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 467 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s163 1) (GEQ s202 1)), p2:(OR (NOT (AND (GEQ s3 1) (GEQ s41 1) (GEQ s184 1))) (GEQ s204 1)), p0:(AND (LT s204 1) (LT s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 finished in 731 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&&X(X(p2))))))||G(!p1)))'
[2023-03-20 19:54:19] [INFO ] Flatten gal took : 36 ms
[2023-03-20 19:54:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 19:54:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 375 places, 590 transitions and 1720 arcs took 3 ms.
Total runtime 26360 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1437/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02

BK_STOP 1679342060848

--------------------
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
mcc2023
ltl formula name UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
ltl formula formula --ltl=/tmp/1437/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1437/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1437/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1437/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1437/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-PT-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707801180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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