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.r544-smll-171701110800124.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 ltsminxred
Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.1K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717265977949

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:19:40] [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-06-01 18:19:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:19:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1089 ms
[2024-06-01 18:19:41] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 18:19:41] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2024-06-01 18:19:41] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 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
Reduction of identical properties reduced properties to check from 16 to 13
RANDOM walk for 1227 steps (0 resets) in 77 ms. (15 steps per ms) remains 0/13 properties
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 26 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 18:19:41] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 55 ms.
[2024-06-01 18:19:41] [INFO ] Unfolded 14 HLPN properties in 4 ms.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
[2024-06-01 18:19:41] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 203 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 16 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2024-06-01 18:19:42] [INFO ] Computed 15 invariants in 35 ms
[2024-06-01 18:19:42] [INFO ] Implicit Places using invariants in 398 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 203 out of 227 places after structural reductions.
[2024-06-01 18:19:42] [INFO ] Flatten gal took : 70 ms
[2024-06-01 18:19:42] [INFO ] Flatten gal took : 89 ms
[2024-06-01 18:19:43] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 1062 steps (0 resets) in 130 ms. (8 steps per ms) remains 0/14 properties
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 44 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 18:19:43] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 18:19:44] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 18:19:44] [INFO ] Invariant cache hit.
[2024-06-01 18:19:44] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 12446 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 19152 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 32358ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 32400ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32938 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-00
Product exploration explored 100000 steps with 1436 reset in 570 ms.
Product exploration explored 100000 steps with 1371 reset in 462 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 654 steps (0 resets) in 10 ms. (59 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 18:20:18] [INFO ] Invariant cache hit.
[2024-06-01 18:20:18] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 finished in 35281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(X((!p0 U (p1||G(!p0))))&&p2))))) U (G(X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0))))))))))||(G(!p2)&&X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))))))))'
Support contains 83 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 12 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-06-01 18:20:19] [INFO ] Invariant cache hit.
[2024-06-01 18:20:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 18:20:19] [INFO ] Invariant cache hit.
[2024-06-01 18:20:19] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11224 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18469 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 30088ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30093ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30330 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Product exploration explored 100000 steps with 2006 reset in 1414 ms.
Product exploration explored 100000 steps with 1999 reset in 1449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))))]
Knowledge based reduction with 14 factoid took 428 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 96 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 14 factoid took 832 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 18:20:54] [INFO ] Invariant cache hit.
[2024-06-01 18:20:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 18:20:54] [INFO ] Invariant cache hit.
[2024-06-01 18:20:54] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:20:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11937 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18872 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 31181ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 31189ms
Finished structural reductions in LTL mode , in 1 iterations and 31417 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 14 factoid took 426 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 96 steps (0 resets) in 9 ms. (9 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (OR p1 p0))), (F p0), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 712 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 2023 reset in 1912 ms.
Product exploration explored 100000 steps with 1974 reset in 1913 ms.
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 18:21:31] [INFO ] Invariant cache hit.
[2024-06-01 18:21:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 18:21:31] [INFO ] Invariant cache hit.
[2024-06-01 18:21:31] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:21:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11880 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18783 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 31016ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 31020ms
Finished structural reductions in LTL mode , in 1 iterations and 31263 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 103938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Support contains 149 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 221 transition count 348
Applied a total of 12 rules in 40 ms. Remains 221 /227 variables (removed 6) and now considering 348/354 (removed 6) transitions.
// Phase 1: matrix 348 rows 221 cols
[2024-06-01 18:22:03] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 18:22:03] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 18:22:03] [INFO ] Invariant cache hit.
[2024-06-01 18:22:03] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-01 18:22:03] [INFO ] Redundant transitions in 29 ms returned []
Running 318 sub problems to find dead transitions.
[2024-06-01 18:22:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 18039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 24712 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 43143ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 43150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/227 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43566 ms. Remains : 221/227 places, 348/354 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
Product exploration explored 100000 steps with 44710 reset in 1944 ms.
Product exploration explored 100000 steps with 44626 reset in 1879 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 384 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1)]
RANDOM walk for 54 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 445 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
[2024-06-01 18:22:51] [INFO ] Invariant cache hit.
[2024-06-01 18:22:52] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-06-01 18:22:52] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-06-01 18:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:22:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 18:22:53] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-06-01 18:22:53] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 32 ms.
[2024-06-01 18:22:55] [INFO ] Added : 265 causal constraints over 54 iterations in 1807 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 16 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-01 18:22:55] [INFO ] Invariant cache hit.
[2024-06-01 18:22:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 18:22:55] [INFO ] Invariant cache hit.
[2024-06-01 18:22:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-01 18:22:55] [INFO ] Redundant transitions in 8 ms returned []
Running 318 sub problems to find dead transitions.
[2024-06-01 18:22:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 17468 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 25262 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 43104ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 43109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43440 ms. Remains : 221/221 places, 348/348 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 403 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
RANDOM walk for 30 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 581 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
[2024-06-01 18:23:40] [INFO ] Invariant cache hit.
[2024-06-01 18:23:41] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2024-06-01 18:23:41] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-06-01 18:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:23:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 18:23:42] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-06-01 18:23:42] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 18:23:44] [INFO ] Added : 265 causal constraints over 54 iterations in 1688 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 44682 reset in 1961 ms.
Product exploration explored 100000 steps with 44672 reset in 1819 ms.
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 20 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-01 18:23:48] [INFO ] Invariant cache hit.
[2024-06-01 18:23:48] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 18:23:48] [INFO ] Invariant cache hit.
[2024-06-01 18:23:48] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-01 18:23:48] [INFO ] Redundant transitions in 7 ms returned []
Running 318 sub problems to find dead transitions.
[2024-06-01 18:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 17779 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 24301 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 42440ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 42447ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42877 ms. Remains : 221/221 places, 348/348 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 finished in 148045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Applied a total of 396 rules in 34 ms. Remains 50 /227 variables (removed 177) and now considering 48/354 (removed 306) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-06-01 18:24:31] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 18:24:31] [INFO ] Implicit Places using invariants in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/227 places, 48/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 49/227 places, 48/354 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 198 steps with 0 reset with depth 199 and stack size 199 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 421 place count 37 transition count 36
Applied a total of 421 rules in 23 ms. Remains 37 /227 variables (removed 190) and now considering 36/354 (removed 318) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-06-01 18:24:31] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 18:24:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 18:24:31] [INFO ] Invariant cache hit.
[2024-06-01 18:24:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 18:24:31] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 18:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 852ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/227 places, 36/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 980 ms. Remains : 37/227 places, 36/354 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 161 ms.
Stack based approach found an accepted trace after 470 steps with 0 reset with depth 471 and stack size 471 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 finished in 1280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Applied a total of 216 rules in 52 ms. Remains 131 /227 variables (removed 96) and now considering 234/354 (removed 120) transitions.
// Phase 1: matrix 234 rows 131 cols
[2024-06-01 18:24:32] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 18:24:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 18:24:32] [INFO ] Invariant cache hit.
[2024-06-01 18:24:32] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-01 18:24:32] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 18:24:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 145 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 228/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 373 constraints, problems are : Problem set: 0 solved, 228 unsolved in 11199 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 18600ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 18603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/227 places, 234/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18862 ms. Remains : 131/227 places, 234/354 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 508 ms.
Stack based approach found an accepted trace after 16242 steps with 0 reset with depth 16243 and stack size 16243 in 91 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 finished in 19511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0)))||F(p1))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 9 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 18:24:52] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 18:24:52] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 18:24:52] [INFO ] Invariant cache hit.
[2024-06-01 18:24:52] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9863 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16634 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 26869ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 26873ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27177 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 finished in 27788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 44 transition count 42
Applied a total of 408 rules in 22 ms. Remains 44 /227 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-06-01 18:25:20] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 18:25:20] [INFO ] Implicit Places using invariants in 54 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/227 places, 42/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 43/227 places, 42/354 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
Product exploration explored 100000 steps with 6736 reset in 144 ms.
Product exploration explored 100000 steps with 6771 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 168 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p1), (NOT p0), p1]
// Phase 1: matrix 42 rows 43 cols
[2024-06-01 18:25:21] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 18:25:21] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 18:25:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 18:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:25:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 18:25:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 18:25:21] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:25:21] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG p1
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 18:25:21] [INFO ] Invariant cache hit.
[2024-06-01 18:25:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 18:25:21] [INFO ] Invariant cache hit.
[2024-06-01 18:25:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 18:25:21] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 18:25:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1056ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1166 ms. Remains : 43/43 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 90 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-06-01 18:25:22] [INFO ] Invariant cache hit.
[2024-06-01 18:25:23] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 18:25:23] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 18:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:25:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 18:25:23] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 18:25:23] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:25:23] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 6757 reset in 145 ms.
Product exploration explored 100000 steps with 6770 reset in 157 ms.
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 18:25:23] [INFO ] Invariant cache hit.
[2024-06-01 18:25:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 18:25:23] [INFO ] Invariant cache hit.
[2024-06-01 18:25:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 18:25:23] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 18:25:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1116ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1232 ms. Remains : 43/43 places, 42/42 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 finished in 4794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((!p1 U (G(!p1)||(!p1&&F(p2)))))))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 18 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 18:25:24] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 18:25:25] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 18:25:25] [INFO ] Invariant cache hit.
[2024-06-01 18:25:25] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:25:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10142 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16889 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27382ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27386ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27798 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
Product exploration explored 100000 steps with 1381 reset in 496 ms.
Product exploration explored 100000 steps with 1404 reset in 536 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) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 383 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 311 steps (0 resets) in 8 ms. (34 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 462 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 18:25:55] [INFO ] Invariant cache hit.
[2024-06-01 18:25:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 18:25:55] [INFO ] Invariant cache hit.
[2024-06-01 18:25:55] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9881 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16990 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27286ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27294ms
Finished structural reductions in LTL mode , in 1 iterations and 27642 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 105 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 311 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1321 reset in 363 ms.
Product exploration explored 100000 steps with 1400 reset in 385 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 155 transition count 282
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 78 place count 155 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 152 transition count 186
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 152 transition count 186
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 134 transition count 168
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 134 transition count 168
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 120 rules in 41 ms. Remains 134 /155 variables (removed 21) and now considering 168/282 (removed 114) transitions.
[2024-06-01 18:26:25] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 134 cols
[2024-06-01 18:26:25] [INFO ] Computed 14 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 18:26:25] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 6/134 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 7/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 168/302 variables, 134/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 156 constraints, problems are : Problem set: 36 solved, 126 unsolved in 6235 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 36 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 42/134 variables, 14/15 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 7/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 168/302 variables, 134/156 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 126/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/282 constraints. Problems are: Problem set: 36 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 282 constraints, problems are : Problem set: 36 solved, 126 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 126/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 10575ms problems are : Problem set: 36 solved, 126 unsolved
Search for dead transitions found 36 dead transitions in 10580ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 134/155 places, 132/282 transitions.
Graph (complete) has 246 edges and 134 vertex of which 98 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 9 ms. Remains 97 /134 variables (removed 37) and now considering 132/132 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/155 places, 132/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10637 ms. Remains : 97/155 places, 132/282 transitions.
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 18:26:35] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 18:26:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 18:26:35] [INFO ] Invariant cache hit.
[2024-06-01 18:26:36] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:26:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10226 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16918 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27481ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27485ms
Finished structural reductions in LTL mode , in 1 iterations and 27841 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 finished in 98717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 9 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-06-01 18:27:03] [INFO ] Invariant cache hit.
[2024-06-01 18:27:03] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 18:27:03] [INFO ] Invariant cache hit.
[2024-06-01 18:27:04] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16469 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 26824ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 26827ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27658 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 8153 reset in 434 ms.
Product exploration explored 100000 steps with 8195 reset in 439 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 322 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 198 steps (0 resets) in 13 ms. (14 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 744 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 18:27:33] [INFO ] Invariant cache hit.
[2024-06-01 18:27:34] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 18:27:34] [INFO ] Invariant cache hit.
[2024-06-01 18:27:34] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27392ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27396ms
Finished structural reductions in LTL mode , in 1 iterations and 27848 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 561 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 206 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 748 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8180 reset in 426 ms.
Product exploration explored 100000 steps with 8089 reset in 436 ms.
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-01 18:28:04] [INFO ] Invariant cache hit.
[2024-06-01 18:28:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 18:28:04] [INFO ] Invariant cache hit.
[2024-06-01 18:28:04] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:28:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10160 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16835 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27336ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27341ms
Finished structural reductions in LTL mode , in 1 iterations and 27692 ms. Remains : 155/155 places, 282/282 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 88752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||G(p1))))'
Support contains 54 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Applied a total of 247 rules in 22 ms. Remains 115 /227 variables (removed 112) and now considering 150/354 (removed 204) transitions.
// Phase 1: matrix 150 rows 115 cols
[2024-06-01 18:28:32] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 18:28:32] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 18:28:32] [INFO ] Invariant cache hit.
[2024-06-01 18:28:32] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-01 18:28:32] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-01 18:28:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 128 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3638 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7066ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/227 places, 150/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7371 ms. Remains : 115/227 places, 150/354 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 finished in 7480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 24 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 265 place count 97 transition count 114
Iterating global reduction 0 with 18 rules applied. Total rules applied 283 place count 97 transition count 114
Applied a total of 283 rules in 22 ms. Remains 97 /227 variables (removed 130) and now considering 114/354 (removed 240) transitions.
// Phase 1: matrix 114 rows 97 cols
[2024-06-01 18:28:39] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 18:28:39] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 18:28:39] [INFO ] Invariant cache hit.
[2024-06-01 18:28:40] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-06-01 18:28:40] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 18:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 110 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 200 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2263 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 4346ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4348ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/227 places, 114/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4623 ms. Remains : 97/227 places, 114/354 transitions.
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
Product exploration explored 100000 steps with 3615 reset in 214 ms.
Stack based approach found an accepted trace after 16570 steps with 605 reset with depth 25 and stack size 25 in 48 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 finished in 4999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-06-01 18:28:44] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 18:28:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 18:28:44] [INFO ] Invariant cache hit.
[2024-06-01 18:28:45] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 18:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9958 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 27330ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27335ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27611 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 736 ms.
Product exploration explored 100000 steps with 33333 reset in 846 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 35 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 finished in 29376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(X((!p0 U (p1||G(!p0))))&&p2))))) U (G(X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0))))))))))||(G(!p2)&&X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 83 out of 227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 156 place count 149 transition count 276
Applied a total of 156 rules in 9 ms. Remains 149 /227 variables (removed 78) and now considering 276/354 (removed 78) transitions.
// Phase 1: matrix 276 rows 149 cols
[2024-06-01 18:29:14] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 18:29:14] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 18:29:14] [INFO ] Invariant cache hit.
[2024-06-01 18:29:15] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-06-01 18:29:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 6/149 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 276/425 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 163 constraints, problems are : Problem set: 0 solved, 246 unsolved in 8614 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 6/149 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 276/425 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 246/409 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 409 constraints, problems are : Problem set: 0 solved, 246 unsolved in 14414 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints]
After SMT, in 23338ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 23343ms
Starting structural reductions in LI_LTL mode, iteration 1 : 149/227 places, 276/354 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23790 ms. Remains : 149/227 places, 276/354 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Product exploration explored 100000 steps with 2053 reset in 1340 ms.
Stack based approach found an accepted trace after 56551 steps with 1130 reset with depth 117 and stack size 117 in 763 ms.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 26314 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((!p1 U (G(!p1)||(!p1&&F(p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 204 place count 125 transition count 252
Applied a total of 204 rules in 9 ms. Remains 125 /227 variables (removed 102) and now considering 252/354 (removed 102) transitions.
// Phase 1: matrix 252 rows 125 cols
[2024-06-01 18:29:41] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 18:29:41] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 18:29:41] [INFO ] Invariant cache hit.
[2024-06-01 18:29:41] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 18:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7086 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12173 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 19590ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 19594ms
Starting structural reductions in LI_LTL mode, iteration 1 : 125/227 places, 252/354 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 19996 ms. Remains : 125/227 places, 252/354 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 9764 reset in 483 ms.
Product exploration explored 100000 steps with 9835 reset in 498 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 21 factoid took 517 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 165 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 935 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 252/252 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 18:30:04] [INFO ] Invariant cache hit.
[2024-06-01 18:30:04] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 18:30:04] [INFO ] Invariant cache hit.
[2024-06-01 18:30:04] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 18:30:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 6979 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 11654 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 18959ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 18962ms
Finished structural reductions in LTL mode , in 1 iterations and 19284 ms. Remains : 125/125 places, 252/252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 21 factoid took 508 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 252 steps (0 resets) in 8 ms. (28 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 940 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9776 reset in 519 ms.
Product exploration explored 100000 steps with 9832 reset in 504 ms.
Support contains 36 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 252/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 18:30:26] [INFO ] Invariant cache hit.
[2024-06-01 18:30:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 18:30:26] [INFO ] Invariant cache hit.
[2024-06-01 18:30:26] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 18:30:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 139 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7077 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 252/377 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 228/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 367 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12313 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 19783ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 19786ms
Finished structural reductions in LTL mode , in 1 iterations and 20131 ms. Remains : 125/125 places, 252/252 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 65934 ms.
[2024-06-01 18:30:46] [INFO ] Flatten gal took : 82 ms
[2024-06-01 18:30:46] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 57 ms.
[2024-06-01 18:30:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 227 places, 354 transitions and 1032 arcs took 7 ms.
Total runtime 667019 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10

BK_STOP 1717266948627

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
ltl formula formula --ltl=/tmp/2565/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 354 transitions and 1032 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
ltl formula formula --ltl=/tmp/2565/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 354 transitions and 1032 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.000 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
ltl formula formula --ltl=/tmp/2565/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 354 transitions and 1032 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 229 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 228, there are 359 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~36 levels ~10000 states ~21796 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~20000 states ~42132 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~40000 states ~93888 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~80000 states ~216748 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~160000 states ~552304 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~320000 states ~1243640 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~640000 states ~2291188 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~1280000 states ~5052868 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~2560000 states ~11373652 transitions
pnml2lts-mc( 1/ 4): ~36 levels ~5120000 states ~22831532 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~10240000 states ~42836976 transitions
pnml2lts-mc( 2/ 4): ~35 levels ~20480000 states ~89442136 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553479
pnml2lts-mc( 0/ 4): unique states count: 33553577
pnml2lts-mc( 0/ 4): unique transitions count: 149554840
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 116000415
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553582 states 149554898 transitions, fanout: 4.457
pnml2lts-mc( 0/ 4): Total exploration time 299.440 sec (299.380 sec minimum, 299.408 sec on average)
pnml2lts-mc( 0/ 4): States per second: 112054, Transitions per second: 499449
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 302.4MB, 9.5 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/72.0%
pnml2lts-mc( 0/ 4): Stored 357 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 302.4MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
ltl formula formula --ltl=/tmp/2565/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 354 transitions and 1032 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
ltl formula formula --ltl=/tmp/2565/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 227 places, 354 transitions and 1032 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2565/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2565/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2565/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2565/ltl_4_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-smll-171701110800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N06.tgz
mv UtilityControlRoom-COL-Z4T4N06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;