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.r485-tall-167912700201012.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 itstools
Input is UtilityControlRoom-COL-Z2T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700201012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.3K Feb 26 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 14:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 14:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 14:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679313512843

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T4N08
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-20 11:58:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 11:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:58:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 11:58:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 11:58:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 402 ms
[2023-03-20 11:58:34] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 11:58:34] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 78 ms.
[2023-03-20 11:58:34] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 55 steps, including 0 resets, run visited all 11 properties in 9 ms. (steps per millisecond=6 )
[2023-03-20 11:58:35] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:58:35] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 11:58:35] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 13 ms.
[2023-03-20 11:58:35] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-20 11:58:35] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-20 11:58:35] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-20 11:58:35] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-20 11:58:35] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2023-03-20 11:58:35] [INFO ] Computed 19 place invariants in 22 ms
[2023-03-20 11:58:35] [INFO ] Implicit Places using invariants in 179 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 123 out of 139 places after structural reductions.
[2023-03-20 11:58:35] [INFO ] Flatten gal took : 23 ms
[2023-03-20 11:58:35] [INFO ] Flatten gal took : 21 ms
[2023-03-20 11:58:35] [INFO ] Input system was already deterministic with 184 transitions.
Finished random walk after 891 steps, including 0 resets, run visited all 15 properties in 23 ms. (steps per millisecond=38 )
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((p0&&F(p1)))))'
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2023-03-20 11:58:35] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 11:58:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 11:58:35] [INFO ] Invariant cache hit.
[2023-03-20 11:58:36] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-20 11:58:36] [INFO ] Invariant cache hit.
[2023-03-20 11:58:36] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 finished in 767 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 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 203 place count 49 transition count 48
Applied a total of 203 rules in 29 ms. Remains 49 /139 variables (removed 90) and now considering 48/184 (removed 136) transitions.
// Phase 1: matrix 48 rows 49 cols
[2023-03-20 11:58:36] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-20 11:58:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 11:58:36] [INFO ] Invariant cache hit.
[2023-03-20 11:58:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-20 11:58:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:58:36] [INFO ] Invariant cache hit.
[2023-03-20 11:58:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/139 places, 48/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 49/139 places, 48/184 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s31 1) (GEQ s26 1) (GEQ s25 1) (GEQ s28 1) (GEQ s27 1) (GEQ s30 1) (GEQ s29 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 3956 reset in 263 ms.
Product exploration explored 100000 steps with 4200 reset in 210 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2023-03-20 11:58:37] [INFO ] Invariant cache hit.
[2023-03-20 11:58:37] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-20 11:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:58:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-20 11:58:37] [INFO ] Computed and/alt/rep : 40/56/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 11:58:37] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-20 11:58:37] [INFO ] Invariant cache hit.
[2023-03-20 11:58:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 11:58:38] [INFO ] Invariant cache hit.
[2023-03-20 11:58:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-20 11:58:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:58:38] [INFO ] Invariant cache hit.
[2023-03-20 11:58:38] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 49/49 places, 48/48 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), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-20 11:58:38] [INFO ] Invariant cache hit.
[2023-03-20 11:58:38] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-20 11:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:58:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 11:58:38] [INFO ] Computed and/alt/rep : 40/56/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 11:58:38] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3975 reset in 154 ms.
Product exploration explored 100000 steps with 4179 reset in 248 ms.
Built C files in :
/tmp/ltsmin12343127360825431347
[2023-03-20 11:58:39] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-20 11:58:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:39] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-20 11:58:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:39] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-20 11:58:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12343127360825431347
Running compilation step : cd /tmp/ltsmin12343127360825431347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin12343127360825431347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12343127360825431347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3802185722711653115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-20 11:58:54] [INFO ] Invariant cache hit.
[2023-03-20 11:58:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 11:58:54] [INFO ] Invariant cache hit.
[2023-03-20 11:58:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-20 11:58:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:58:54] [INFO ] Invariant cache hit.
[2023-03-20 11:58:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 49/49 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin13421466386095022725
[2023-03-20 11:58:54] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-20 11:58:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:54] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-20 11:58:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:54] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-20 11:58:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:58:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13421466386095022725
Running compilation step : cd /tmp/ltsmin13421466386095022725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 122 ms.
Running link step : cd /tmp/ltsmin13421466386095022725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13421466386095022725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14484897113768227242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 11:59:09] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:59:09] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:59:09] [INFO ] Time to serialize gal into /tmp/LTL10305277127774409559.gal : 2 ms
[2023-03-20 11:59:09] [INFO ] Time to serialize properties into /tmp/LTL12238406572575832383.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10305277127774409559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15806892381644216292.hoa' '-atoms' '/tmp/LTL12238406572575832383.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12238406572575832383.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15806892381644216292.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.096566,17792,1,0,54,22133,24,1,1197,14438,139
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 finished in 33123 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((G(p0)||(p1&&X(p2))))))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 11 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 11:59:09] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 11:59:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 11:59:09] [INFO ] Invariant cache hit.
[2023-03-20 11:59:09] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-20 11:59:09] [INFO ] Invariant cache hit.
[2023-03-20 11:59:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 113 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 p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 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 12179 reset in 507 ms.
Product exploration explored 100000 steps with 12171 reset in 528 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) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 14 factoid took 724 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 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 p2))]
Finished random walk after 41 steps, including 0 resets, run visited all 8 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 14 factoid took 856 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 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 p2))]
Stuttering acceptance computed with spot in 125 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 p2))]
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-20 11:59:13] [INFO ] Invariant cache hit.
[2023-03-20 11:59:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 11:59:13] [INFO ] Invariant cache hit.
[2023-03-20 11:59:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-20 11:59:13] [INFO ] Invariant cache hit.
[2023-03-20 11:59:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 123/123 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 14 factoid took 698 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 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 p2))]
Finished random walk after 56 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 14 factoid took 877 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 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 p2))]
Stuttering acceptance computed with spot in 116 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 p2))]
Stuttering acceptance computed with spot in 130 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 p2))]
Product exploration explored 100000 steps with 12333 reset in 508 ms.
Product exploration explored 100000 steps with 12219 reset in 503 ms.
Built C files in :
/tmp/ltsmin8358746020636664060
[2023-03-20 11:59:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8358746020636664060
Running compilation step : cd /tmp/ltsmin8358746020636664060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin8358746020636664060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8358746020636664060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10131723555515798916.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 finished in 7274 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((G(p0) U (!p1||G(F(!p2))))))'
Support contains 83 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2023-03-20 11:59:17] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 11:59:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 11:59:17] [INFO ] Invariant cache hit.
[2023-03-20 11:59:17] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-20 11:59:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:59:17] [INFO ] Invariant cache hit.
[2023-03-20 11:59:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND p1 p2), p2, p2, (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0)), (AND p1 p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p0:(AND (OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 253 reset in 217 ms.
Product exploration explored 100000 steps with 227 reset in 219 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) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 19 factoid took 1041 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1 p2), p2, p2]
Finished random walk after 598 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 19 factoid took 1000 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1 p2), p2, p2]
Support contains 83 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 14 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-20 11:59:20] [INFO ] Invariant cache hit.
[2023-03-20 11:59:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 11:59:20] [INFO ] Invariant cache hit.
[2023-03-20 11:59:20] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-20 11:59:20] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:59:20] [INFO ] Invariant cache hit.
[2023-03-20 11:59:20] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 139/139 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 8 factoid took 555 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1 p2), p2, p2]
Finished random walk after 1177 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p1 p2), p2, p2]
Product exploration explored 100000 steps with 227 reset in 209 ms.
Product exploration explored 100000 steps with 234 reset in 218 ms.
Built C files in :
/tmp/ltsmin12218561489544501564
[2023-03-20 11:59:22] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2023-03-20 11:59:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:22] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2023-03-20 11:59:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:22] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2023-03-20 11:59:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:22] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12218561489544501564
Running compilation step : cd /tmp/ltsmin12218561489544501564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 347 ms.
Running link step : cd /tmp/ltsmin12218561489544501564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12218561489544501564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9182950384366102398.hoa' '--buchi-type=spotba'
LTSmin run took 382 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 finished in 6200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U (G(!p2)&&(X(G(p4))||p3)))))'
Support contains 99 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-20 11:59:23] [INFO ] Invariant cache hit.
[2023-03-20 11:59:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 11:59:23] [INFO ] Invariant cache hit.
[2023-03-20 11:59:23] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-20 11:59:23] [INFO ] Invariant cache hit.
[2023-03-20 11:59:23] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 539 ms :[(OR p2 (AND (NOT p3) (NOT p4))), true, p2, (NOT p4), (OR p2 (AND (NOT p3) (NOT p4))), p2, (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), p2, (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND p2 (NOT p4)), (AND p2 (NOT p4)), (AND p2 (NOT p4))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=0 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={} source=3 dest: 1}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=4 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 (NOT p0) (NOT p4)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={} source=6 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p1) p0) (AND p2 (NOT p1) p0 p4)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1 p0 (NOT p4)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={1} source=6 dest: 5}, { cond=(OR (AND p2 (NOT p0) p4) (AND (NOT p3) (NOT p0) p4)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(OR (AND (NOT p2) (NOT p3) p1 p0) (AND p2 p1 p0 p4)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p0) p4), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) p0 p4), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p2) p3 p1 p0 p4), acceptance={} source=6 dest: 11}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=8 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND p2 (NOT p1) p4)), acceptance={} source=8 dest: 3}, { cond=(AND p2 p1 (NOT p4)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={1} source=8 dest: 7}, { cond=(OR (AND p2 p1 p4) (AND (NOT p3) p1 p4)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p4)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p1) p4), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p2) p3 p1 p4), acceptance={} source=8 dest: 11}], [{ cond=(AND p2 (NOT p0) (NOT p4)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 2}, { cond=(AND p2 (NOT p1) p0 p4), acceptance={} source=9 dest: 3}, { cond=(AND p2 p1 p0 (NOT p4)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) p4), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1 p0 p4), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p4), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p2) p1 p0 p4), acceptance={} source=9 dest: 11}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=10 dest: 2}, { cond=(AND p2 p4), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p2) p4), acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=11 dest: 2}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=11 dest: 3}, { cond=(AND p2 p1 (NOT p4)), acceptance={0, 1} source=11 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={1} source=11 dest: 7}, { cond=(AND p2 p1 p4), acceptance={0} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(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 s43 1) (GEQ s42 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-07 finished in 773 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 U (p1||G(!p0))))))'
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Applied a total of 112 rules in 13 ms. Remains 91 /139 variables (removed 48) and now considering 120/184 (removed 64) transitions.
// Phase 1: matrix 120 rows 91 cols
[2023-03-20 11:59:24] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 11:59:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 11:59:24] [INFO ] Invariant cache hit.
[2023-03-20 11:59:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-20 11:59:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 11:59:24] [INFO ] Invariant cache hit.
[2023-03-20 11:59:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/139 places, 120/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 91/139 places, 120/184 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s65 1) (GEQ s66 1) (GEQ s63 1) (GEQ s64 1) (GEQ s61 1) (GEQ s62 1) (GEQ s59 1) (GEQ s60 1))) (NOT (OR (AND (GEQ s0 1) (GEQ s25 1) (G...], 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 3120 reset in 227 ms.
Product exploration explored 100000 steps with 3191 reset in 238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 56 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 27 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-20 11:59:25] [INFO ] Invariant cache hit.
[2023-03-20 11:59:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 11:59:25] [INFO ] Invariant cache hit.
[2023-03-20 11:59:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-20 11:59:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:59:25] [INFO ] Invariant cache hit.
[2023-03-20 11:59:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 91/91 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3177 reset in 204 ms.
Stack based approach found an accepted trace after 2509 steps with 85 reset with depth 17 and stack size 17 in 6 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 finished in 2567 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(((F(p1) U X(G(p2)))||p0))))'
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 170 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 58 transition count 56
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 202 place count 50 transition count 48
Applied a total of 202 rules in 30 ms. Remains 50 /139 variables (removed 89) and now considering 48/184 (removed 136) transitions.
// Phase 1: matrix 48 rows 50 cols
[2023-03-20 11:59:26] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-20 11:59:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 11:59:26] [INFO ] Invariant cache hit.
[2023-03-20 11:59:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-20 11:59:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:59:26] [INFO ] Invariant cache hit.
[2023-03-20 11:59:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/139 places, 48/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 50/139 places, 48/184 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1)), p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2312 reset in 184 ms.
Product exploration explored 100000 steps with 2272 reset in 202 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 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 18 factoid took 895 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:59:28] [INFO ] Invariant cache hit.
[2023-03-20 11:59:28] [INFO ] After 46ms 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 19 factoid took 1197 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 16 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-20 11:59:29] [INFO ] Invariant cache hit.
[2023-03-20 11:59:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 11:59:29] [INFO ] Invariant cache hit.
[2023-03-20 11:59:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-20 11:59:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:59:30] [INFO ] Invariant cache hit.
[2023-03-20 11:59:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 50/50 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 19 factoid took 1191 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 214 steps, including 0 resets, run visited all 10 properties in 7 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 p2)), (F (NOT p1)), (F (NOT p0)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1199 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2427 reset in 206 ms.
Product exploration explored 100000 steps with 2395 reset in 206 ms.
Built C files in :
/tmp/ltsmin6834055788863994619
[2023-03-20 11:59:33] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-20 11:59:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:33] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-20 11:59:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:33] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-20 11:59:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6834055788863994619
Running compilation step : cd /tmp/ltsmin6834055788863994619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin6834055788863994619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6834055788863994619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11796255930769792367.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 finished in 7244 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)||G(!p1)))'
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Applied a total of 112 rules in 11 ms. Remains 91 /139 variables (removed 48) and now considering 120/184 (removed 64) transitions.
// Phase 1: matrix 120 rows 91 cols
[2023-03-20 11:59:33] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 11:59:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 11:59:33] [INFO ] Invariant cache hit.
[2023-03-20 11:59:33] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-20 11:59:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:59:33] [INFO ] Invariant cache hit.
[2023-03-20 11:59:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/139 places, 120/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 91/139 places, 120/184 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s50 1)) (OR (LT s1 1) (LT s13 1) (LT s50 1)) (OR (LT s0 1) (LT s20 1) (LT s50 1)) (OR (LT s0 1) (LT s10 1) (LT s50 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20015 reset in 412 ms.
Product exploration explored 100000 steps with 20105 reset in 421 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 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p0, (AND p0 p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 76 ms :[p0, (AND p0 p1)]
Support contains 27 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-20 11:59:35] [INFO ] Invariant cache hit.
[2023-03-20 11:59:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 11:59:35] [INFO ] Invariant cache hit.
[2023-03-20 11:59:35] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-20 11:59:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:59:35] [INFO ] Invariant cache hit.
[2023-03-20 11:59:35] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 91/91 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p0, (AND p0 p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 81 ms :[p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 72 ms :[p0, (AND p0 p1)]
Product exploration explored 100000 steps with 20187 reset in 414 ms.
Product exploration explored 100000 steps with 20142 reset in 421 ms.
Built C files in :
/tmp/ltsmin16225298616313154674
[2023-03-20 11:59:37] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2023-03-20 11:59:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:37] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2023-03-20 11:59:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:37] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2023-03-20 11:59:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 11:59:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16225298616313154674
Running compilation step : cd /tmp/ltsmin16225298616313154674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin16225298616313154674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16225298616313154674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2827741125747649213.hoa' '--buchi-type=spotba'
LTSmin run took 2530 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 finished in 6643 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)||F(G(p1)))))'
Support contains 59 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 5 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 11:59:40] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 11:59:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 11:59:40] [INFO ] Invariant cache hit.
[2023-03-20 11:59:40] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-20 11:59:40] [INFO ] Invariant cache hit.
[2023-03-20 11:59:40] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 268 ms.
Stack based approach found an accepted trace after 2516 steps with 0 reset with depth 2517 and stack size 2517 in 8 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 finished in 595 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||X(X(F(p1))))))'
Support contains 48 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2023-03-20 11:59:41] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 11:59:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 11:59:41] [INFO ] Invariant cache hit.
[2023-03-20 11:59:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 11:59:41] [INFO ] Invariant cache hit.
[2023-03-20 11:59:41] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p1:(OR (AND (OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 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 25000 reset in 161 ms.
Product exploration explored 100000 steps with 25000 reset in 167 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) p1), (X p0), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 40 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-20 11:59:42] [INFO ] Invariant cache hit.
[2023-03-20 11:59:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 11:59:42] [INFO ] Invariant cache hit.
[2023-03-20 11:59:42] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-20 11:59:42] [INFO ] Invariant cache hit.
[2023-03-20 11:59:42] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 139/139 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 200
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 139 transition count 200
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 40 place count 139 transition count 208
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 40 rules in 15 ms. Remains 139 /139 variables (removed 0) and now considering 208/184 (removed -24) transitions.
[2023-03-20 11:59:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 208 rows 139 cols
[2023-03-20 11:59:44] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 11:59:44] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/139 places, 208/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 139/139 places, 208/184 transitions.
Built C files in :
/tmp/ltsmin2686467407500867815
[2023-03-20 11:59:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2686467407500867815
Running compilation step : cd /tmp/ltsmin2686467407500867815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin2686467407500867815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2686467407500867815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6363630351928216821.hoa' '--buchi-type=spotba'
LTSmin run took 406 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 finished in 3859 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 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 11:59:44] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 11:59:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 11:59:44] [INFO ] Invariant cache hit.
[2023-03-20 11:59:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-20 11:59:45] [INFO ] Invariant cache hit.
[2023-03-20 11:59:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 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 s0 1) (LT s18 1) (LT s82 1)) (OR (LT s1 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s15 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 finished in 342 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 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2023-03-20 11:59:45] [INFO ] Invariant cache hit.
[2023-03-20 11:59:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 11:59:45] [INFO ] Invariant cache hit.
[2023-03-20 11:59:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-20 11:59:45] [INFO ] Invariant cache hit.
[2023-03-20 11:59:45] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 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 s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 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 8 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 finished in 315 ms.
All properties solved by simple procedures.
Total runtime 71350 ms.

BK_STOP 1679313586406

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T4N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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