Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r461-smll-171701122700018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is UtilityControlRoom-COL-Z2T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.9K Apr 13 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 05:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 05:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 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-Z2T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717171588949

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N08
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 16:06:32] [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]
[2024-05-31 16:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:06:32] [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.
[2024-05-31 16:06:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:06:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 965 ms
[2024-05-31 16:06:33] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:06:33] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 9 ms.
[2024-05-31 16:06:33] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 64 steps, including 0 resets, run visited all 11 properties in 19 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-31 16:06:33] [INFO ] Flatten gal took : 32 ms
[2024-05-31 16:06:33] [INFO ] Flatten gal took : 6 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
[2024-05-31 16:06:33] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 37 ms.
[2024-05-31 16:06:33] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-31 16:06:33] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-31 16:06:33] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-31 16:06:33] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-31 16:06:33] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-01 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 12 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-31 16:06:34] [INFO ] Computed 19 invariants in 21 ms
[2024-05-31 16:06:34] [INFO ] Implicit Places using invariants in 332 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 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 351 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 123 out of 139 places after structural reductions.
[2024-05-31 16:06:34] [INFO ] Flatten gal took : 31 ms
[2024-05-31 16:06:34] [INFO ] Flatten gal took : 53 ms
[2024-05-31 16:06:34] [INFO ] Input system was already deterministic with 184 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 17 properties in 12 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1&&X(X(F(p2)))))))'
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 5 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-05-31 16:06:35] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 16:06:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 16:06:35] [INFO ] Invariant cache hit.
[2024-05-31 16:06:35] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-31 16:06:35] [INFO ] Invariant cache hit.
[2024-05-31 16:06:35] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 139/139 places, 184/184 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 550 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s113 1) (GEQ s114 1) (GEQ s111 1) (GEQ s112 1) (GEQ s109 1) (GEQ s110 1) (GEQ s107 1) (GEQ s108 1)), p1:(OR (GEQ s100 1) (GEQ s99 1) (GEQ s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-00 finished in 1171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 56 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2024-05-31 16:06:36] [INFO ] Computed 17 invariants in 2 ms
[2024-05-31 16:06:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 16:06:36] [INFO ] Invariant cache hit.
[2024-05-31 16:06:36] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-31 16:06:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 16:06:36] [INFO ] Invariant cache hit.
[2024-05-31 16:06:36] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s53 1) (GEQ s71 1)) (AND (GEQ s50 1) (GEQ s69 1)) (AND (GEQ s48 1) (GEQ s68 1)) (AND (GEQ s45 1) (GEQ s67 1)) (AND (GEQ s43 1) (GEQ s66 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 647 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 102 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-03 finished in 1165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 19 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
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 2 with 16 rules applied. Total rules applied 128 place count 83 transition count 112
Applied a total of 128 rules in 23 ms. Remains 83 /139 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-31 16:06:37] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 16:06:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 16:06:37] [INFO ] Invariant cache hit.
[2024-05-31 16:06:37] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-31 16:06:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 16:06:37] [INFO ] Invariant cache hit.
[2024-05-31 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/139 places, 112/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 83/139 places, 112/184 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40485 reset in 593 ms.
Product exploration explored 100000 steps with 40501 reset in 390 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-31 16:06:39] [INFO ] Invariant cache hit.
[2024-05-31 16:06:39] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 16:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:06:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-31 16:06:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:06:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-31 16:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:06:40] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-31 16:06:40] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 16:06:40] [INFO ] Added : 44 causal constraints over 10 iterations in 224 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 16:06:40] [INFO ] Invariant cache hit.
[2024-05-31 16:06:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 16:06:40] [INFO ] Invariant cache hit.
[2024-05-31 16:06:40] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-31 16:06:40] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 16:06:40] [INFO ] Invariant cache hit.
[2024-05-31 16:06:40] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 83/83 places, 112/112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-31 16:06:41] [INFO ] Invariant cache hit.
[2024-05-31 16:06:41] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 16:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:06:41] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 16:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:06:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-31 16:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:06:42] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-31 16:06:42] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 16:06:42] [INFO ] Added : 44 causal constraints over 10 iterations in 190 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40498 reset in 357 ms.
Product exploration explored 100000 steps with 40474 reset in 346 ms.
Built C files in :
/tmp/ltsmin14513432409999099197
[2024-05-31 16:06:43] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-05-31 16:06:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:06:43] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-05-31 16:06:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:06:43] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-05-31 16:06:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:06:43] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14513432409999099197
Running compilation step : cd /tmp/ltsmin14513432409999099197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 508 ms.
Running link step : cd /tmp/ltsmin14513432409999099197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14513432409999099197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17496299105144065777.hoa' '--buchi-type=spotba'
LTSmin run took 523 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-04 finished in 6687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G((!p0||G(p1)))) U (G(p3)||p2)))))'
Support contains 51 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
Applied a total of 80 rules in 12 ms. Remains 107 /139 variables (removed 32) and now considering 136/184 (removed 48) transitions.
// Phase 1: matrix 136 rows 107 cols
[2024-05-31 16:06:44] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 16:06:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 16:06:44] [INFO ] Invariant cache hit.
[2024-05-31 16:06:44] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-31 16:06:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 16:06:44] [INFO ] Invariant cache hit.
[2024-05-31 16:06:44] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/139 places, 136/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 107/139 places, 136/184 transitions.
Stuttering acceptance computed with spot in 578 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 2, 3} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2, 3} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=1 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={0, 3} source=1 dest: 6}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2, 3} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)), acceptance={0, 2} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=3 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=3 dest: 2}, { cond=(OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)), acceptance={2} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=3 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=3 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 3} source=3 dest: 6}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=3 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={2, 3} source=3 dest: 8}, { cond=(AND p3 p0 p1), acceptance={3} source=3 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2, 3} source=4 dest: 0}, { cond=(OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))), acceptance={0, 2} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=4 dest: 3}, { cond=(OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=4 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0, 3} source=4 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p0) p1), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=5 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=5 dest: 5}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0, 2, 3} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=6 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=6 dest: 5}, { cond=p1, acceptance={0, 3} source=6 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=6 dest: 7}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2, 3} source=7 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 2} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 2}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={2} source=7 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=7 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=7 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=7 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=7 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 3} source=7 dest: 6}, { cond=(AND p2 p3 (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=7 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={2, 3} source=7 dest: 8}, { cond=(AND p3 p0 p1), acceptance={3} source=7 dest: 9}], [{ cond=(NOT p3), acceptance={0, 2, 3} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=8 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=8 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=8 dest: 3}, { cond=p3, acceptance={2, 3} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0, 2, 3} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=9 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=9 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=9 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={0, 3} source=9 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=9 dest: 7}, { cond=(AND p3 (NOT p1)), acceptance={2, 3} source=9 dest: 8}, { cond=(AND p3 p1), acceptance={3} source=9 dest: 9}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s18 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s13...], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1978 reset in 1719 ms.
Product exploration explored 100000 steps with 1913 reset in 1696 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND (NOT p2) (NOT p3) p0 p1))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (AND (NOT p2) p3)), (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p2 p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1))))), true, (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1))))), (X (X (AND p2 (NOT p3) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1))))), (X (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))))))]
Knowledge based reduction with 44 factoid took 25457 ms. Reduced automaton from 10 states, 110 edges and 4 AP (stutter insensitive) to 10 states, 115 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 698 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1093 ms. (steps per millisecond=9 ) properties (out of 37) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 16:07:17] [INFO ] Invariant cache hit.
[2024-05-31 16:07:17] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND (NOT p2) (NOT p3) p0 p1))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (AND (NOT p2) p3)), (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p2 p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1))))), true, (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) (NOT p3) p1))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p3 p1))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1))), (G (NOT (AND p0 (NOT p2) p3 p1))), (G (NOT (AND p0 p2 p3 (NOT p1)))), (G (NOT (AND p0 p2 (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1))))), (X (X (AND p2 (NOT p3) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1))))), (X (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1)))))), (F (OR (AND (NOT p0) p1) (AND p2 p1) (AND p3 p1))), (F (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) p3 p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) p3 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (AND (NOT p0) p2 (NOT p3) p1)), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F (OR (AND (NOT p0) p2 p1) (AND (NOT p0) p3 p1))), (F (OR (AND p0 p2 (NOT p1)) (AND p0 p3 (NOT p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND p2 p1) (AND p3 p1))), (F (OR (AND (NOT p0) p3 p1) (AND p2 p3 p1))), (F (AND p0 p2 (NOT p3) p1)), (F (OR (AND (NOT p0) p2 p3) (AND p2 p3 p1))), (F (OR (AND (NOT p0) p3 (NOT p1)) (AND p2 p3 (NOT p1)))), (F (OR (AND (NOT p0) (NOT p3) p1) (AND p2 (NOT p3) p1))), (F (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1))), (F (AND (NOT p0) (NOT p2) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p3 (NOT p1)))), (F (AND p0 p2 p3 p1)), (F (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND p2 (NOT p3) (NOT p1))))), (F (OR (AND (NOT p0) p3) (AND p2 p3) (AND p3 p1))), (F (OR (AND p0 p2 p1) (AND p0 p3 p1))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)) (AND (NOT p3) p1)))), (F (AND (NOT p0) p2 p3 p1))]
Knowledge based reduction with 53 factoid took 7672 ms. Reduced automaton from 10 states, 115 edges and 4 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-31 16:07:25] [INFO ] Invariant cache hit.
[2024-05-31 16:07:26] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-31 16:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:26] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 16:07:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:07:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 16:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:26] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 16:07:26] [INFO ] Computed and/alt/rep : 128/200/128 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 16:07:27] [INFO ] Added : 70 causal constraints over 14 iterations in 310 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 51 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 136/136 transitions.
Applied a total of 0 rules in 12 ms. Remains 107 /107 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-31 16:07:27] [INFO ] Invariant cache hit.
[2024-05-31 16:07:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 16:07:27] [INFO ] Invariant cache hit.
[2024-05-31 16:07:27] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-31 16:07:27] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 16:07:27] [INFO ] Invariant cache hit.
[2024-05-31 16:07:27] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 107/107 places, 136/136 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 p2) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (NOT p0) p2 p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (OR (AND (NOT p0) p3) (AND p2 p3))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND p0 p2) (AND p0 p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p2 p3))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))))]
Knowledge based reduction with 24 factoid took 1820 ms. Reduced automaton from 5 states, 34 edges and 3 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Finished random walk after 145 steps, including 0 resets, run visited all 14 properties in 4 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (NOT p0) p2 p3)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (OR (AND (NOT p0) p3) (AND p2 p3))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND p0 p2) (AND p0 p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (OR (NOT p0) p2 p3))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p2 p3))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (F (AND p0 p2 (NOT p3))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) p3)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (OR (AND (NOT p0) p3) (AND p2 p3))), (F (OR (AND p0 p2) (AND p0 p3))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (F (AND p0 (NOT p2) p3)), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 p2 p3)), (F (AND (NOT p0) p2 p3))]
Knowledge based reduction with 24 factoid took 3399 ms. Reduced automaton from 5 states, 34 edges and 3 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-31 16:07:33] [INFO ] Invariant cache hit.
[2024-05-31 16:07:33] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 16:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:34] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 16:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:07:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 16:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:34] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 16:07:34] [INFO ] Computed and/alt/rep : 128/200/128 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 16:07:34] [INFO ] Added : 70 causal constraints over 14 iterations in 311 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1474 reset in 1424 ms.
Stack based approach found an accepted trace after 11203 steps with 148 reset with depth 215 and stack size 215 in 120 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-05 finished in 52412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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.
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
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 96 place count 91 transition count 136
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 90 transition count 104
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 123 place count 81 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 131 place count 81 transition count 88
Applied a total of 131 rules in 31 ms. Remains 81 /139 variables (removed 58) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 81 cols
[2024-05-31 16:07:36] [INFO ] Computed 17 invariants in 2 ms
[2024-05-31 16:07:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 16:07:36] [INFO ] Invariant cache hit.
[2024-05-31 16:07:36] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 16:07:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:07:36] [INFO ] Invariant cache hit.
[2024-05-31 16:07:36] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 81/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s38 1) (GEQ s37 1) (GEQ s40 1) (GEQ s39 1) (GEQ s25 1) (GEQ s26 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7656 reset in 385 ms.
Product exploration explored 100000 steps with 7593 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-05-31 16:07:38] [INFO ] Invariant cache hit.
[2024-05-31 16:07:38] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 16:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:38] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 16:07:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:07:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-31 16:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:38] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 16:07:38] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 16:07:38] [INFO ] Added : 50 causal constraints over 10 iterations in 167 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-31 16:07:38] [INFO ] Invariant cache hit.
[2024-05-31 16:07:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 16:07:38] [INFO ] Invariant cache hit.
[2024-05-31 16:07:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-31 16:07:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:07:38] [INFO ] Invariant cache hit.
[2024-05-31 16:07:39] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 81/81 places, 88/88 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-31 16:07:39] [INFO ] Invariant cache hit.
[2024-05-31 16:07:39] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-31 16:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:39] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 16:07:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:07:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 16:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:07:39] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 16:07:39] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 16:07:40] [INFO ] Added : 50 causal constraints over 10 iterations in 166 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7668 reset in 334 ms.
Product exploration explored 100000 steps with 7610 reset in 238 ms.
Built C files in :
/tmp/ltsmin6547839191534053587
[2024-05-31 16:07:40] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-31 16:07:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:40] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-31 16:07:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:40] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-31 16:07:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6547839191534053587
Running compilation step : cd /tmp/ltsmin6547839191534053587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin6547839191534053587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6547839191534053587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14171270975132303559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-31 16:07:55] [INFO ] Invariant cache hit.
[2024-05-31 16:07:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 16:07:55] [INFO ] Invariant cache hit.
[2024-05-31 16:07:56] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 16:07:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:07:56] [INFO ] Invariant cache hit.
[2024-05-31 16:07:56] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 81/81 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin5621333906390433580
[2024-05-31 16:07:56] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-31 16:07:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:56] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-31 16:07:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:56] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-31 16:07:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:07:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5621333906390433580
Running compilation step : cd /tmp/ltsmin5621333906390433580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin5621333906390433580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5621333906390433580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2631065980217835154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 16:08:11] [INFO ] Flatten gal took : 12 ms
[2024-05-31 16:08:11] [INFO ] Flatten gal took : 12 ms
[2024-05-31 16:08:11] [INFO ] Time to serialize gal into /tmp/LTL923571230954575631.gal : 4 ms
[2024-05-31 16:08:11] [INFO ] Time to serialize properties into /tmp/LTL1809188833306937797.prop : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL923571230954575631.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11468396978740051331.hoa' '-atoms' '/tmp/LTL1809188833306937797.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1809188833306937797.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11468396978740051331.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
41 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.464552,23744,1,0,95,58694,20,20,1870,40272,193
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-06 finished in 35333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(!p0)&&F(G(p1))))||(X(F((G(p1)&&p2)))&&(!p3||X(!p3)))))))'
Support contains 24 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
[2024-05-31 16:08:12] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 16:08:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 16:08:12] [INFO ] Invariant cache hit.
[2024-05-31 16:08:12] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 16:08:12] [INFO ] Invariant cache hit.
[2024-05-31 16:08:12] [INFO ] Dead Transitions using invariants and state equation in 166 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 422 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (AND p0 (NOT p2)) (AND p0 p3)), (OR (NOT p1) (AND p0 (NOT p2)) (AND p0 p3)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (AND p0 p3), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 p3), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}, { cond=(AND p0 p3), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 p3 p2), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p3 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p3), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1 p3 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (LT s84 1) (LT s83 1) (LT s86 1) (LT s85 1) (LT s89 1) (LT s87 1) (LT s90 1) (LT s88 1) (LT s97 1) (LT s98 1) (LT s95 1) (LT s96 1) (LT s93 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Stack based approach found an accepted trace after 7783 steps with 0 reset with depth 7784 and stack size 7784 in 32 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-07 finished in 1450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F(p1)))))'
Support contains 32 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.
[2024-05-31 16:08:13] [INFO ] Invariant cache hit.
[2024-05-31 16:08:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 16:08:13] [INFO ] Invariant cache hit.
[2024-05-31 16:08:13] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-31 16:08:13] [INFO ] Invariant cache hit.
[2024-05-31 16:08:13] [INFO ] Dead Transitions using invariants and state equation in 229 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 482 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (AND (GEQ s70 1) (GEQ s105 1)) (AND (GEQ s67 1) (GEQ s103...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3839 reset in 205 ms.
Product exploration explored 100000 steps with 3850 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-31 16:08:15] [INFO ] Invariant cache hit.
[2024-05-31 16:08:16] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned unsat
Proved EG (NOT p0)
[2024-05-31 16:08:16] [INFO ] Invariant cache hit.
[2024-05-31 16:08:16] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-31 16:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:08:16] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-31 16:08:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:08:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 16:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:08:16] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-31 16:08:16] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-31 16:08:16] [INFO ] Added : 89 causal constraints over 18 iterations in 407 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 358 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-09 finished in 3844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!p0)&&(X(!p1) U (X(G(!p1))||(!p2&&X(!p1))))) U p3)))'
Support contains 67 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 3 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 16:08:17] [INFO ] Invariant cache hit.
[2024-05-31 16:08:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 16:08:17] [INFO ] Invariant cache hit.
[2024-05-31 16:08:17] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-31 16:08:17] [INFO ] Invariant cache hit.
[2024-05-31 16:08:17] [INFO ] Dead Transitions using invariants and state equation in 177 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 393 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p3), (NOT p3), true, p0, p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s26 1) (GEQ s27 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 383 steps with 2 reset in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-10 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)&&X((F(!p0) U !p1)))))'
Support contains 16 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 9 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 16:08:18] [INFO ] Invariant cache hit.
[2024-05-31 16:08:18] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 16:08:18] [INFO ] Invariant cache hit.
[2024-05-31 16:08:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-31 16:08:18] [INFO ] Invariant cache hit.
[2024-05-31 16:08:18] [INFO ] Dead Transitions using invariants and state equation in 247 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 604 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR p1 p0), p0, p1, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1)), p1:(OR (GEQ s84 1) (GEQ s83 1) (GEQ s86 1) (GEQ s85 1) (GEQ s89 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3652 reset in 374 ms.
Product exploration explored 100000 steps with 3613 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR p1 p0), p0, p1, p0]
Finished random walk after 29 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR p1 p0), p0, p1, p0]
Stuttering acceptance computed with spot in 198 ms :[(OR p1 p0), p0, p1, p0]
Support contains 16 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.
[2024-05-31 16:08:20] [INFO ] Invariant cache hit.
[2024-05-31 16:08:20] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 16:08:20] [INFO ] Invariant cache hit.
[2024-05-31 16:08:21] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 16:08:21] [INFO ] Invariant cache hit.
[2024-05-31 16:08:21] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR p1 p0), p0, p1, p0]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR p1 p0), p0, p1, p0]
Stuttering acceptance computed with spot in 197 ms :[(OR p1 p0), p0, p1, p0]
Stuttering acceptance computed with spot in 215 ms :[(OR p1 p0), p0, p1, p0]
Product exploration explored 100000 steps with 3553 reset in 386 ms.
Product exploration explored 100000 steps with 3447 reset in 382 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR p1 p0), p0, p1, p0]
Support contains 16 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 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 123 transition count 184
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 184
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 40 place count 123 transition count 192
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 123 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 122 transition count 160
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 122 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 66 place count 114 transition count 152
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 74 place count 114 transition count 152
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 98 transition count 120
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 98 transition count 120
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 122 place count 82 transition count 104
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 138 place count 82 transition count 104
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 154 place count 82 transition count 88
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 154 rules in 30 ms. Remains 82 /123 variables (removed 41) and now considering 88/168 (removed 80) transitions.
[2024-05-31 16:08:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2024-05-31 16:08:23] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 16:08:23] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/123 places, 88/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 82/123 places, 88/168 transitions.
Built C files in :
/tmp/ltsmin7280666901301412410
[2024-05-31 16:08:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7280666901301412410
Running compilation step : cd /tmp/ltsmin7280666901301412410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 644 ms.
Running link step : cd /tmp/ltsmin7280666901301412410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7280666901301412410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1706595360615191948.hoa' '--buchi-type=spotba'
LTSmin run took 538 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-11 finished in 7255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(G(!p1)))) U p2))'
Support contains 67 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 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-05-31 16:08:25] [INFO ] Computed 18 invariants in 6 ms
[2024-05-31 16:08:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 16:08:25] [INFO ] Invariant cache hit.
[2024-05-31 16:08:25] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-31 16:08:25] [INFO ] Invariant cache hit.
[2024-05-31 16:08:25] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR p1 p0), true, (NOT p2), (OR (NOT p2) p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (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)) (NOT (OR (GEQ s100 1) (GEQ s99 1) (GEQ s102 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-12 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p1 U (G(!p1)||p2))&&p0)))'
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 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-31 16:08:26] [INFO ] Invariant cache hit.
[2024-05-31 16:08:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 16:08:26] [INFO ] Invariant cache hit.
[2024-05-31 16:08:26] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-31 16:08:26] [INFO ] Invariant cache hit.
[2024-05-31 16:08:26] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(OR (GEQ s113 1) (GEQ s114 1) (GEQ s111 1) (GEQ s112 1) (GEQ s109 1) (GEQ s110 1) (GEQ s107 1) (GEQ s108 1)), p1:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-13 finished in 1752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 24 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
[2024-05-31 16:08:27] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 16:08:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 16:08:27] [INFO ] Invariant cache hit.
[2024-05-31 16:08:28] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-31 16:08:28] [INFO ] Invariant cache hit.
[2024-05-31 16:08:28] [INFO ] Dead Transitions using invariants and state equation in 152 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 598 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s105 1)) (AND (GEQ s67 1) (GEQ s103 1)) (AND (GEQ s65 1) (GEQ s102 1)) (AND (GEQ s62 1) (GEQ s101 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-14 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 24 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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 13 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2024-05-31 16:08:28] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 16:08:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 16:08:28] [INFO ] Invariant cache hit.
[2024-05-31 16:08:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-31 16:08:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 16:08:28] [INFO ] Invariant cache hit.
[2024-05-31 16:08:28] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s42 1) (GEQ s57 1)) (AND (GEQ s47 1) (GEQ s60 1)) (AND (GEQ s52 1) (GEQ s62 1)) (AND (GEQ s55 1) (GEQ s64 1)) (AND (GEQ s44 1) (GEQ s58 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 2771 reset in 252 ms.
Stack based approach found an accepted trace after 1839 steps with 64 reset with depth 23 and stack size 23 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLFireability-15 finished in 592 ms.
All properties solved by simple procedures.
Total runtime 116961 ms.

BK_STOP 1717171710280

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-Z2T3N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is UtilityControlRoom-COL-Z2T3N08, 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 r461-smll-171701122700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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