Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 11K Apr 13 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 05:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 05:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717265484103

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:11:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:11:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 18:11:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:11:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1153 ms
[2024-06-01 18:11:27] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 80 PT places and 150.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 18:11:27] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2024-06-01 18:11:27] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 177 steps (0 resets) in 23 ms. (7 steps per ms) remains 0/9 properties
[2024-06-01 18:11:27] [INFO ] Flatten gal took : 22 ms
[2024-06-01 18:11:27] [INFO ] Flatten gal took : 6 ms
Domain [Cli(2), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
[2024-06-01 18:11:27] [INFO ] Unfolded HLPN to a Petri net with 80 places and 150 transitions 482 arcs in 32 ms.
[2024-06-01 18:11:27] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2024-06-01 18:11:27] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 18:11:27] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 71 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-06-01 18:11:28] [INFO ] Computed 7 invariants in 13 ms
[2024-06-01 18:11:28] [INFO ] Implicit Places using invariants in 270 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 79/80 places, 118/118 transitions.
Support contains 71 out of 79 places after structural reductions.
[2024-06-01 18:11:28] [INFO ] Flatten gal took : 27 ms
[2024-06-01 18:11:28] [INFO ] Flatten gal took : 31 ms
[2024-06-01 18:11:28] [INFO ] Input system was already deterministic with 118 transitions.
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 399 steps (0 resets) in 49 ms. (7 steps per ms) remains 0/11 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' '!(X(G((G((G(p1)||p0))||F(p2)))))'
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-06-01 18:11:29] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 18:11:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 18:11:29] [INFO ] Invariant cache hit.
[2024-06-01 18:11:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 18:11:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3395 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3694 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 7273ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7303ms
Finished structural reductions in LTL mode , in 1 iterations and 7534 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 7090 reset in 731 ms.
Product exploration explored 100000 steps with 7002 reset in 597 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 39 steps (0 resets) in 16 ms. (2 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 11 factoid took 630 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 116
Applied a total of 4 rules in 28 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-06-01 18:11:39] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 18:11:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 18:11:39] [INFO ] Invariant cache hit.
[2024-06-01 18:11:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-01 18:11:39] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 18:11:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2956 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5884ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5888ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/79 places, 116/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6105 ms. Remains : 77/79 places, 116/118 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 519 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 47 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 721 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7865 reset in 716 ms.
Product exploration explored 100000 steps with 7937 reset in 711 ms.
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 18:11:49] [INFO ] Invariant cache hit.
[2024-06-01 18:11:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 18:11:49] [INFO ] Invariant cache hit.
[2024-06-01 18:11:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-01 18:11:49] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 18:11:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2962 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5602ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5798 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 25991 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 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:11:54] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 18:11:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 18:11:55] [INFO ] Invariant cache hit.
[2024-06-01 18:11:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:11:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4432ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4434ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4557 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 finished in 4700 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) U X(G((X(G(!p2))||p1)))))'
Support contains 33 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:11:59] [INFO ] Invariant cache hit.
[2024-06-01 18:11:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 18:11:59] [INFO ] Invariant cache hit.
[2024-06-01 18:11:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:11:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2002 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4559ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4562ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4669 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2, true, (AND p2 (NOT p0)), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 finished in 5014 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(F(!p0))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:12:04] [INFO ] Invariant cache hit.
[2024-06-01 18:12:04] [INFO ] Implicit Places using invariants in 78 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 19458 reset in 190 ms.
Product exploration explored 100000 steps with 19332 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
RANDOM walk for 19 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 123 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-06-01 18:12:05] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 18:12:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 18:12:06] [INFO ] Invariant cache hit.
[2024-06-01 18:12:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:12:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 59 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1872 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 92/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 151 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4070ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4073ms
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 54/54 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0]
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 19554 reset in 120 ms.
Product exploration explored 100000 steps with 19538 reset in 137 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 54 transition count 102
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 102
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 26 place count 54 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 51 transition count 76
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 51 transition count 76
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 33 transition count 46
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 33 transition count 46
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 21 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 21 transition count 34
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 21 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 112 rules in 28 ms. Remains 21 /54 variables (removed 33) and now considering 22/94 (removed 72) transitions.
[2024-06-01 18:12:11] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 18:12:11] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 18:12:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 18:12:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 15 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 28 constraints, problems are : Problem set: 10 solved, 10 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 10/21 variables, 5/6 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 10/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 38 constraints, problems are : Problem set: 10 solved, 10 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 571ms problems are : Problem set: 10 solved, 10 unsolved
Search for dead transitions found 10 dead transitions in 572ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 21/54 places, 12/94 transitions.
Graph (complete) has 24 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 13 /21 variables (removed 8) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/54 places, 12/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 619 ms. Remains : 13/54 places, 12/94 transitions.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-06-01 18:12:12] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 18:12:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 18:12:12] [INFO ] Invariant cache hit.
[2024-06-01 18:12:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:12:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 59 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 92/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 151 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4021ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4023ms
Finished structural reductions in LTL mode , in 1 iterations and 4227 ms. Remains : 54/54 places, 94/94 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 11939 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((X(!p1)||p0)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:12:16] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:12:16] [INFO ] Implicit Places using invariants in 82 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 11 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-06-01 18:12:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:12:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 18:12:17] [INFO ] Invariant cache hit.
[2024-06-01 18:12:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 18:12:17] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 18:12:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2422ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2547 ms. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 514 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 finished in 3121 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))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 13 transition count 12
Applied a total of 145 rules in 16 ms. Remains 13 /79 variables (removed 66) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-06-01 18:12:20] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 18:12:20] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/79 places, 12/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 10
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-06-01 18:12:20] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 18:12:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 18:12:20] [INFO ] Invariant cache hit.
[2024-06-01 18:12:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/79 places, 10/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 10/79 places, 10/118 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 70 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 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 finished in 310 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)||F(G(!p1))))))'
Support contains 18 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:12:20] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:12:20] [INFO ] Implicit Places using invariants in 69 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 196 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 finished in 452 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)||(F(p1)&&X(G(p2))))))'
Support contains 57 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-06-01 18:12:20] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 18:12:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 18:12:20] [INFO ] Invariant cache hit.
[2024-06-01 18:12:21] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 18:12:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2877 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3550 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6478ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6482ms
Finished structural reductions in LTL mode , in 1 iterations and 6616 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
Product exploration explored 100000 steps with 29344 reset in 419 ms.
Product exploration explored 100000 steps with 29357 reset in 436 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 18:12:29] [INFO ] Invariant cache hit.
[2024-06-01 18:12:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 18:12:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 18:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:12:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 18:12:30] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 18:12:30] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 18:12:30] [INFO ] Added : 59 causal constraints over 12 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 0 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-06-01 18:12:30] [INFO ] Invariant cache hit.
[2024-06-01 18:12:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 18:12:30] [INFO ] Invariant cache hit.
[2024-06-01 18:12:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 18:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3000 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3539 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6588ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6590ms
Finished structural reductions in LTL mode , in 1 iterations and 6772 ms. Remains : 79/79 places, 118/118 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 18:12:38] [INFO ] Invariant cache hit.
[2024-06-01 18:12:38] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 18:12:38] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 18:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:12:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:12:38] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 18:12:38] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 18:12:38] [INFO ] Added : 59 causal constraints over 12 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 29262 reset in 194 ms.
Product exploration explored 100000 steps with 29358 reset in 186 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 40 place count 79 transition count 110
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 79 transition count 118
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 79 transition count 118
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 72 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 96 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 96 rules in 16 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:12:39] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:12:39] [INFO ] Computed 6 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 18:12:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 18:12:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 63 constraints, problems are : Problem set: 24 solved, 68 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 24 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 18/55 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 68/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 131 constraints, problems are : Problem set: 24 solved, 68 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 68/92 constraints, Known Traps: 2/2 constraints]
After SMT, in 3672ms problems are : Problem set: 24 solved, 68 unsolved
Search for dead transitions found 24 dead transitions in 3674ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/79 places, 70/118 transitions.
Graph (complete) has 106 edges and 55 vertex of which 39 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 39 /55 variables (removed 16) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/79 places, 70/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3705 ms. Remains : 39/79 places, 70/118 transitions.
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:12:43] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:12:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 18:12:43] [INFO ] Invariant cache hit.
[2024-06-01 18:12:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:12:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4443ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4445ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4579 ms. Remains : 55/79 places, 94/118 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 finished in 26872 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 (p1&&X(G(!p0))))))'
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:12:47] [INFO ] Invariant cache hit.
[2024-06-01 18:12:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 18:12:47] [INFO ] Invariant cache hit.
[2024-06-01 18:12:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:12:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4544ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4546ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4675 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 finished in 4850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U G(p1))))'
Support contains 10 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:12:52] [INFO ] Invariant cache hit.
[2024-06-01 18:12:52] [INFO ] Implicit Places using invariants in 104 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-14
Product exploration explored 100000 steps with 9078 reset in 297 ms.
Stack based approach found an accepted trace after 76073 steps with 6877 reset with depth 12 and stack size 12 in 217 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 finished in 891 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((F(p1)||p0)))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 18:12:53] [INFO ] Invariant cache hit.
[2024-06-01 18:12:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 18:12:53] [INFO ] Invariant cache hit.
[2024-06-01 18:12:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:12:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2001 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4444ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4446ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4569 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Product exploration explored 100000 steps with 7245 reset in 184 ms.
Product exploration explored 100000 steps with 7261 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 56 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 18:12:59] [INFO ] Invariant cache hit.
[2024-06-01 18:12:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:12:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 18:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:13:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:13:00] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 18:13:00] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:13:00] [INFO ] Added : 92 causal constraints over 19 iterations in 234 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-01 18:13:00] [INFO ] Invariant cache hit.
[2024-06-01 18:13:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 18:13:00] [INFO ] Invariant cache hit.
[2024-06-01 18:13:00] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:13:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2093 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4609ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4611ms
Finished structural reductions in LTL mode , in 1 iterations and 4745 ms. Remains : 55/55 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 18:13:06] [INFO ] Invariant cache hit.
[2024-06-01 18:13:06] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:13:06] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 18:13:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:13:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 18:13:06] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 18:13:06] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:13:06] [INFO ] Added : 92 causal constraints over 19 iterations in 217 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7240 reset in 186 ms.
Product exploration explored 100000 steps with 7267 reset in 198 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 55 transition count 102
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 55 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 24 rules in 10 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-01 18:13:07] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:13:07] [INFO ] Computed 6 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 18:13:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/7 constraints. Problems are: Problem set: 12 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 80 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 62 constraints, problems are : Problem set: 24 solved, 68 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 24 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 18/55 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/7 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 68/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 130 constraints, problems are : Problem set: 24 solved, 68 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 68/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 3649ms problems are : Problem set: 24 solved, 68 unsolved
Search for dead transitions found 24 dead transitions in 3651ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/55 places, 70/94 transitions.
Graph (complete) has 106 edges and 55 vertex of which 39 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 39 /55 variables (removed 16) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/55 places, 70/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3675 ms. Remains : 39/55 places, 70/94 transitions.
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 18:13:11] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 18:13:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 18:13:11] [INFO ] Invariant cache hit.
[2024-06-01 18:13:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 18:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2318 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4370ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4371ms
Finished structural reductions in LTL mode , in 1 iterations and 4517 ms. Remains : 55/55 places, 94/94 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 finished in 22377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((G(p1)||p0))||F(p2)))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 116
Applied a total of 4 rules in 4 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-06-01 18:13:16] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:13:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 18:13:16] [INFO ] Invariant cache hit.
[2024-06-01 18:13:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 18:13:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5840ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5841ms
Starting structural reductions in LI_LTL mode, iteration 1 : 77/79 places, 116/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5993 ms. Remains : 77/79 places, 116/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 7978 reset in 492 ms.
Product exploration explored 100000 steps with 7859 reset in 489 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 553 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 33 steps (0 resets) in 8 ms. (3 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 6 factoid took 758 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 18:13:24] [INFO ] Invariant cache hit.
[2024-06-01 18:13:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 18:13:24] [INFO ] Invariant cache hit.
[2024-06-01 18:13:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-01 18:13:25] [INFO ] Redundant transitions in 6 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 18:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2831 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5884ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5886ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6055 ms. Remains : 77/77 places, 116/116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 566 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 50 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 687 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7950 reset in 687 ms.
Product exploration explored 100000 steps with 7849 reset in 704 ms.
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 18:13:34] [INFO ] Invariant cache hit.
[2024-06-01 18:13:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 18:13:34] [INFO ] Invariant cache hit.
[2024-06-01 18:13:34] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 18:13:34] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 18:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5782ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5927 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 24244 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(F(!p0))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
Stuttering acceptance computed with spot in 116 ms :[p0, p0, p0]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 14 transition count 12
Applied a total of 144 rules in 9 ms. Remains 14 /79 variables (removed 65) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 14 cols
[2024-06-01 18:13:40] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 18:13:40] [INFO ] Implicit Places using invariants in 36 ms returned [0, 7]
[2024-06-01 18:13:40] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/79 places, 12/118 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 47 ms. Remains : 13/79 places, 12/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 20582 reset in 71 ms.
Product exploration explored 100000 steps with 20624 reset in 77 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0]
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-06-01 18:13:41] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 18:13:41] [INFO ] Implicit Places using invariants in 30 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/13 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 12/13 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 20680 reset in 63 ms.
Product exploration explored 100000 steps with 20767 reset in 74 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 14/12 (removed -2) transitions.
[2024-06-01 18:13:42] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 18:13:42] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 18:13:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 18:13:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 18 constraints, problems are : Problem set: 4 solved, 8 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 26 constraints, problems are : Problem set: 4 solved, 8 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 295ms problems are : Problem set: 4 solved, 8 unsolved
Search for dead transitions found 4 dead transitions in 295ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/12 transitions.
Graph (complete) has 14 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/12 places, 10/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 10/12 places, 10/12 transitions.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-06-01 18:13:42] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 18:13:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 18:13:42] [INFO ] Invariant cache hit.
[2024-06-01 18:13:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 18:13:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 10 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 2945 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)||(F(p1)&&X(G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p1)||p0)))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 5 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-06-01 18:13:43] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 18:13:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 18:13:43] [INFO ] Invariant cache hit.
[2024-06-01 18:13:43] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 18:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2366ms
Starting structural reductions in LI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2479 ms. Remains : 37/79 places, 68/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Product exploration explored 100000 steps with 9723 reset in 229 ms.
Product exploration explored 100000 steps with 9818 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 18:13:47] [INFO ] Invariant cache hit.
[2024-06-01 18:13:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 18:13:47] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 18:13:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:13:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:13:47] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 18:13:47] [INFO ] Computed and/alt/rep : 58/128/58 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 18:13:48] [INFO ] Added : 55 causal constraints over 12 iterations in 112 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 18:13:48] [INFO ] Invariant cache hit.
[2024-06-01 18:13:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 18:13:48] [INFO ] Invariant cache hit.
[2024-06-01 18:13:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 18:13:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2428ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2429ms
Finished structural reductions in LTL mode , in 1 iterations and 2531 ms. Remains : 37/37 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 265 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 18:13:51] [INFO ] Invariant cache hit.
[2024-06-01 18:13:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:13:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 18:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:13:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 18:13:51] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 18:13:51] [INFO ] Computed and/alt/rep : 58/128/58 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 18:13:52] [INFO ] Added : 55 causal constraints over 12 iterations in 121 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 9742 reset in 227 ms.
Product exploration explored 100000 steps with 9782 reset in 239 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 18:13:53] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 18:13:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2387ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2404 ms. Remains : 37/37 places, 68/68 transitions.
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 18:13:55] [INFO ] Invariant cache hit.
[2024-06-01 18:13:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 18:13:55] [INFO ] Invariant cache hit.
[2024-06-01 18:13:55] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 18:13:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1172 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2291ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2292ms
Finished structural reductions in LTL mode , in 1 iterations and 2391 ms. Remains : 37/37 places, 68/68 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 finished in 14641 ms.
[2024-06-01 18:13:57] [INFO ] Flatten gal took : 15 ms
[2024-06-01 18:13:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2024-06-01 18:13:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 118 transitions and 344 arcs took 6 ms.
Total runtime 151914 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717265639743

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

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

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

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
ltl formula formula --ltl=/tmp/2574/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 118 transitions and 344 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2574/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2574/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2574/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2574/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 81 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 80, there are 121 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~18 levels ~10000 states ~26380 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12524
pnml2lts-mc( 0/ 4): unique states count: 12524
pnml2lts-mc( 0/ 4): unique transitions count: 38662
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26342
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12671
pnml2lts-mc( 0/ 4): - cum. max stack depth: 70
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12671 states 39366 transitions, fanout: 3.107
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 105592, Transitions per second: 328050
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.6 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 118 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
ltl formula formula --ltl=/tmp/2574/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 118 transitions and 344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2574/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2574/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2574/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2574/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 81 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 80, there are 137 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 57
pnml2lts-mc( 0/ 4): unique states count: 57
pnml2lts-mc( 0/ 4): unique transitions count: 60
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 45
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 94
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 94 states 219 transitions, fanout: 2.330
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.0 B/state, compr.: 10.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 118 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
ltl formula formula --ltl=/tmp/2574/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 118 transitions and 344 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2574/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2574/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2574/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2574/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 81 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 80, there are 125 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~25 levels ~10000 states ~26056 transitions
pnml2lts-mc( 3/ 4): ~25 levels ~20000 states ~59476 transitions
pnml2lts-mc( 2/ 4): ~85 levels ~40000 states ~137864 transitions
pnml2lts-mc( 3/ 4): ~3599 levels ~80000 states ~329924 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 56974
pnml2lts-mc( 0/ 4): unique states count: 114013
pnml2lts-mc( 0/ 4): unique transitions count: 542704
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 265677
pnml2lts-mc( 0/ 4): - claim found count: 163099
pnml2lts-mc( 0/ 4): - claim success count: 114069
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 114083 states 543087 transitions, fanout: 4.760
pnml2lts-mc( 0/ 4): Total exploration time 0.910 sec (0.910 sec minimum, 0.910 sec on average)
pnml2lts-mc( 0/ 4): States per second: 125366, Transitions per second: 596799
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 11.2 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 118 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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