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.r444-smll-171701110600020.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 itstools
Input is UtilityControlRoom-COL-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 13 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 13 05:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 13 05:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:03 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-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717071498640

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 12:18:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 12:18:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:18:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 12:18:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 12:18:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1239 ms
[2024-05-30 12:18:22] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 106 PT places and 162.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 12:18:22] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 12:18:22] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 12 to 10
RANDOM walk for 244 steps (0 resets) in 18 ms. (12 steps per ms) remains 0/10 properties
[2024-05-30 12:18:23] [INFO ] Flatten gal took : 21 ms
[2024-05-30 12:18:23] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 12:18:23] [INFO ] Unfolded HLPN to a Petri net with 106 places and 162 transitions 510 arcs in 28 ms.
[2024-05-30 12:18:23] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 12:18:23] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-05-30 12:18:23] [INFO ] Computed 15 invariants in 31 ms
[2024-05-30 12:18:23] [INFO ] Implicit Places using invariants in 351 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 105/106 places, 138/138 transitions.
Support contains 93 out of 105 places after structural reductions.
[2024-05-30 12:18:23] [INFO ] Flatten gal took : 39 ms
[2024-05-30 12:18:23] [INFO ] Flatten gal took : 39 ms
[2024-05-30 12:18:23] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 5008 steps (0 resets) in 320 ms. (15 steps per ms) remains 0/12 properties
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' '!(F((X(G(p1))&&p0)))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
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 36 place count 87 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 86 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 80 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 74 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 74 transition count 78
Applied a total of 74 rules in 60 ms. Remains 74 /105 variables (removed 31) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 74 cols
[2024-05-30 12:18:24] [INFO ] Computed 14 invariants in 4 ms
[2024-05-30 12:18:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 12:18:24] [INFO ] Invariant cache hit.
[2024-05-30 12:18:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-30 12:18:24] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 12:18:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 88 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 66/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3720ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4036 ms. Remains : 74/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 728 ms.
Stack based approach found an accepted trace after 1254 steps with 0 reset with depth 1255 and stack size 1255 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 finished in 5182 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)))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 7 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 12:18:29] [INFO ] Computed 14 invariants in 4 ms
[2024-05-30 12:18:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 12:18:29] [INFO ] Invariant cache hit.
[2024-05-30 12:18:29] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:18:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3826 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4280 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8211ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8214ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8435 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 finished in 9163 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)&&(!p2 U (G(!p2)||(!p2&&G(!p1)))))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 126
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 81 transition count 114
Applied a total of 48 rules in 14 ms. Remains 81 /105 variables (removed 24) and now considering 114/138 (removed 24) transitions.
// Phase 1: matrix 114 rows 81 cols
[2024-05-30 12:18:38] [INFO ] Computed 14 invariants in 4 ms
[2024-05-30 12:18:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 12:18:38] [INFO ] Invariant cache hit.
[2024-05-30 12:18:39] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-30 12:18:39] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-30 12:18:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 95 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2331 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 108/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 203 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5293ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5296ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/105 places, 114/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5498 ms. Remains : 81/105 places, 114/138 transitions.
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p1) p2), p2, (AND (NOT p0) p2), (AND p2 p1), (AND p2 p1 (NOT p0)), p1, (AND p1 (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 finished in 5984 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(p1)||G((X(p3)&&p2))||p0)))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 10 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 12:18:44] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 12:18:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 12:18:44] [INFO ] Invariant cache hit.
[2024-05-30 12:18:45] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3828 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7704ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7708ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7993 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 finished in 8869 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((p0&&F(p1))))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 12:18:53] [INFO ] Invariant cache hit.
[2024-05-30 12:18:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 12:18:53] [INFO ] Invariant cache hit.
[2024-05-30 12:18:53] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3470 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5481 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9009ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9011ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9215 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 237 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) p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 37 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 finished in 10023 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||X(X(F(!p0))))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 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 128 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 140 place count 44 transition count 42
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 165 place count 31 transition count 30
Applied a total of 165 rules in 35 ms. Remains 31 /105 variables (removed 74) and now considering 30/138 (removed 108) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-05-30 12:19:03] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 12:19:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 12:19:03] [INFO ] Invariant cache hit.
[2024-05-30 12:19:03] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-30 12:19:03] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 12:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 68 constraints, problems are : Problem set: 0 solved, 24 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/105 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 ms. Remains : 31/105 places, 30/138 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
Product exploration explored 100000 steps with 4890 reset in 352 ms.
Stack based approach found an accepted trace after 67 steps with 3 reset with depth 13 and stack size 13 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 finished in 1751 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((!p0||G(F(p0)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 8 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 12:19:05] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 12:19:05] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-30 12:19:05] [INFO ] Invariant cache hit.
[2024-05-30 12:19:05] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:19:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3230 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4816 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8121ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8124ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8456 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 192 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
Product exploration explored 100000 steps with 5226 reset in 176 ms.
Product exploration explored 100000 steps with 5276 reset in 398 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 189 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-30 12:19:15] [INFO ] Invariant cache hit.
[2024-05-30 12:19:15] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-30 12:19:15] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-30 12:19:15] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 12:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:19:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-30 12:19:15] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-30 12:19:15] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 12:19:16] [INFO ] Added : 20 causal constraints over 5 iterations in 118 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 114
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 84 place count 51 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 96 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 50 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 49 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 43 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 43 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 37 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 37 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 37 transition count 36
Applied a total of 129 rules in 25 ms. Remains 37 /93 variables (removed 56) and now considering 36/126 (removed 90) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-30 12:19:16] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 12:19:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 12:19:16] [INFO ] Invariant cache hit.
[2024-05-30 12:19:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 12:19:16] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 12:19:16] [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 625 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 489 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 1126ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/93 places, 36/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1285 ms. Remains : 37/93 places, 36/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 158 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 197 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-05-30 12:19:17] [INFO ] Invariant cache hit.
[2024-05-30 12:19:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-30 12:19:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-30 12:19:18] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 12:19:18] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6003 reset in 239 ms.
Product exploration explored 100000 steps with 6007 reset in 390 ms.
Built C files in :
/tmp/ltsmin15875142837006979307
[2024-05-30 12:19:18] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2024-05-30 12:19:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:19:18] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2024-05-30 12:19:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:19:18] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2024-05-30 12:19:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:19:18] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15875142837006979307
Running compilation step : cd /tmp/ltsmin15875142837006979307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 585 ms.
Running link step : cd /tmp/ltsmin15875142837006979307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15875142837006979307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18261500106061724484.hoa' '--buchi-type=spotba'
LTSmin run took 5460 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 finished in 19574 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(G(!p0))&&F(p1))))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 98 place count 62 transition count 72
Applied a total of 98 rules in 12 ms. Remains 62 /105 variables (removed 43) and now considering 72/138 (removed 66) transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-30 12:19:25] [INFO ] Computed 14 invariants in 4 ms
[2024-05-30 12:19:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 12:19:25] [INFO ] Invariant cache hit.
[2024-05-30 12:19:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 12:19:25] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 12:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 76 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2539ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/105 places, 72/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2683 ms. Remains : 62/105 places, 72/138 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 286 ms.
Stack based approach found an accepted trace after 656 steps with 0 reset with depth 657 and stack size 657 in 4 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 finished in 3117 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(p0)&&X(G(p1))))'
Support contains 33 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 12:19:28] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 12:19:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 12:19:28] [INFO ] Invariant cache hit.
[2024-05-30 12:19:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:19:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5341 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9629ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9633ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9805 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 finished in 10004 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||X(p1))))'
Support contains 33 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 4 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 12:19:38] [INFO ] Invariant cache hit.
[2024-05-30 12:19:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 12:19:38] [INFO ] Invariant cache hit.
[2024-05-30 12:19:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:19:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4325 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4760 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9157ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9161ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9354 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 finished in 9474 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(G(p0))))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 3 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 12:19:47] [INFO ] Invariant cache hit.
[2024-05-30 12:19:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 12:19:47] [INFO ] Invariant cache hit.
[2024-05-30 12:19:47] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 12:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4179 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8300ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8304ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8545 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 finished in 8737 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(G(!p0)) U G(!p1))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2024-05-30 12:19:56] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 12:19:56] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 12:19:56] [INFO ] Invariant cache hit.
[2024-05-30 12:19:56] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 12:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5337 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6191 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11599ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11602ms
Finished structural reductions in LTL mode , in 1 iterations and 11929 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 261 ms :[p1, p1, p0, (AND p1 p0), true, (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 340 steps with 82 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 finished in 12222 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(G(p1))))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 68 transition count 78
Applied a total of 86 rules in 17 ms. Remains 68 /105 variables (removed 37) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 12:20:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 12:20:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 12:20:08] [INFO ] Invariant cache hit.
[2024-05-30 12:20:08] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-30 12:20:08] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 12:20:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/68 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/146 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 82 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/68 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/146 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 66/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 148 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3713ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3714ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3936 ms. Remains : 68/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 402 ms.
Stack based approach found an accepted trace after 517 steps with 0 reset with depth 518 and stack size 518 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 finished in 4467 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) U X(G((p1&&(p2 U X(p3))))))))'
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2024-05-30 12:20:13] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 12:20:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 12:20:13] [INFO ] Invariant cache hit.
[2024-05-30 12:20:13] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 12:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4777 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5620 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10440ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10442ms
Finished structural reductions in LTL mode , in 1 iterations and 10586 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15
Product exploration explored 100000 steps with 5453 reset in 414 ms.
Product exploration explored 100000 steps with 5444 reset in 297 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
Knowledge based reduction with 18 factoid took 554 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 76 steps (0 resets) in 15 ms. (4 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 1477 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 12:20:28] [INFO ] Invariant cache hit.
[2024-05-30 12:20:28] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-30 12:20:28] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-30 12:20:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:20:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 12:20:29] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-30 12:20:29] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 12:20:29] [INFO ] Added : 34 causal constraints over 7 iterations in 126 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 12:20:29] [INFO ] Invariant cache hit.
[2024-05-30 12:20:29] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-30 12:20:29] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-30 12:20:29] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 12:20:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:20:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-30 12:20:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-30 12:20:29] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 12:20:29] [INFO ] Added : 32 causal constraints over 7 iterations in 102 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-30 12:20:29] [INFO ] Invariant cache hit.
[2024-05-30 12:20:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 12:20:29] [INFO ] Invariant cache hit.
[2024-05-30 12:20:29] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 12:20:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4698 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10315ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10320ms
Finished structural reductions in LTL mode , in 1 iterations and 10522 ms. Remains : 105/105 places, 138/138 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) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0))))]
Knowledge based reduction with 18 factoid took 681 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 570 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 87 steps (0 resets) in 14 ms. (5 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 1660 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 567 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 550 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 12:20:44] [INFO ] Invariant cache hit.
[2024-05-30 12:20:44] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-30 12:20:44] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-30 12:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:20:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 12:20:44] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-30 12:20:44] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 12:20:44] [INFO ] Added : 34 causal constraints over 7 iterations in 163 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 12:20:44] [INFO ] Invariant cache hit.
[2024-05-30 12:20:45] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-30 12:20:45] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-30 12:20:45] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 12:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:20:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-30 12:20:45] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-30 12:20:45] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 12:20:45] [INFO ] Added : 32 causal constraints over 7 iterations in 145 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 558 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Product exploration explored 100000 steps with 5426 reset in 409 ms.
Product exploration explored 100000 steps with 5399 reset in 436 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-30 12:20:48] [INFO ] Redundant transitions in 6 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 12:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4208 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4524 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8803ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8806ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8826 ms. Remains : 105/105 places, 138/138 transitions.
Built C files in :
/tmp/ltsmin17012932200365244149
[2024-05-30 12:20:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17012932200365244149
Running compilation step : cd /tmp/ltsmin17012932200365244149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin17012932200365244149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17012932200365244149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8459142398721284512.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 finished in 44777 ms.
All properties solved by simple procedures.
Total runtime 156681 ms.

BK_STOP 1717071657888

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z2T3N06, 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 r444-smll-171701110600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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