About the Execution of ITS-Tools for UtilityControlRoom-COL-Z2T4N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2347.771 | 382825.00 | 729471.00 | 1265.80 | FTFTFFTFTFFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r444-smll-171701110700068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is UtilityControlRoom-COL-Z2T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110700068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 13 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 05:07 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.8K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 05:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717074462513
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T4N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 13:07:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:07:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:07:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 13:07:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 13:07:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1212 ms
[2024-05-30 13:07:46] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 13:07:46] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2024-05-30 13:07:46] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (8 resets) in 1221 ms. (32 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 466 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
// Phase 1: matrix 11 rows 13 cols
[2024-05-30 13:07:47] [INFO ] Computed 5 invariants in 5 ms
Problem AtomicPropp2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 12/24 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-30 13:07:47] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:07:47] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 13:07:47] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 25 ms.
[2024-05-30 13:07:47] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2024-05-30 13:07:47] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 123 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 13:07:48] [INFO ] Computed 19 invariants in 18 ms
[2024-05-30 13:07:48] [INFO ] Implicit Places using invariants in 229 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 123 out of 139 places after structural reductions.
[2024-05-30 13:07:48] [INFO ] Flatten gal took : 48 ms
[2024-05-30 13:07:48] [INFO ] Flatten gal took : 72 ms
[2024-05-30 13:07:48] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 1377 ms. (29 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 791 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 734 ms. (54 steps per ms) remains 2/2 properties
// Phase 1: matrix 184 rows 139 cols
[2024-05-30 13:07:49] [INFO ] Computed 18 invariants in 4 ms
Problem AtomicPropp3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 139/323 variables, and 18 constraints, problems are : Problem set: 2 solved, 0 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
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' '!(G(F(F(!(X(p0) U ((!p0 U p1)||G(p2)))))))'
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 35 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 13:07:50] [INFO ] Computed 18 invariants in 11 ms
[2024-05-30 13:07:50] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-30 13:07:50] [INFO ] Invariant cache hit.
[2024-05-30 13:07:50] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7832 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8004 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 16021ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 16027ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16609 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 549 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-00
Product exploration explored 100000 steps with 7187 reset in 947 ms.
Product exploration explored 100000 steps with 7147 reset in 766 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 511 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR p1 p2), (OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2]
RANDOM walk for 40000 steps (8 resets) in 881 ms. (45 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1623 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 2/2 properties
[2024-05-30 13:08:11] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 27/291 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 650 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Stuttering acceptance computed with spot in 418 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Support contains 27 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 91 transition count 136
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 80 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 83 transition count 112
Applied a total of 96 rules in 66 ms. Remains 83 /123 variables (removed 40) and now considering 112/168 (removed 56) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-30 13:08:12] [INFO ] Computed 18 invariants in 3 ms
[2024-05-30 13:08:12] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 13:08:12] [INFO ] Invariant cache hit.
[2024-05-30 13:08:12] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-30 13:08:12] [INFO ] Redundant transitions in 4 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-30 13:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2765 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 5017ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 5021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/123 places, 112/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5372 ms. Remains : 83/123 places, 112/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 753 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 89 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 1173 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 422 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Stuttering acceptance computed with spot in 310 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Stuttering acceptance computed with spot in 338 ms :[(OR p1 p2), (OR p1 p2 p0), p0, p1, p2, false, false]
Product exploration explored 100000 steps with 5579 reset in 656 ms.
Stack based approach found an accepted trace after 99554 steps with 5517 reset with depth 26 and stack size 26 in 624 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 finished in 32519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 10 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 13:08:22] [INFO ] Computed 18 invariants in 3 ms
[2024-05-30 13:08:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 13:08:22] [INFO ] Invariant cache hit.
[2024-05-30 13:08:23] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5372 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 11534ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 11539ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11853 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-01
Product exploration explored 100000 steps with 3432 reset in 205 ms.
Product exploration explored 100000 steps with 3441 reset in 229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 114 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-05-30 13:08:35] [INFO ] Invariant cache hit.
[2024-05-30 13:08:35] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-30 13:08:35] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-30 13:08:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:08:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-30 13:08:36] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-30 13:08:36] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 13:08:36] [INFO ] Added : 70 causal constraints over 14 iterations in 279 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 123 transition count 152
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 107 transition count 152
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 80 place count 83 transition count 128
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 96 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 82 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 74 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 74 transition count 88
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 66 transition count 72
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 66 transition count 72
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 58 transition count 64
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 58 transition count 64
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 58 transition count 56
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 170 place count 50 transition count 48
Applied a total of 170 rules in 62 ms. Remains 50 /123 variables (removed 73) and now considering 48/168 (removed 120) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-05-30 13:08:36] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:08:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 13:08:36] [INFO ] Invariant cache hit.
[2024-05-30 13:08:36] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-30 13:08:36] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-30 13:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 10/50 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 10/50 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 32/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 100 constraints, problems are : Problem set: 0 solved, 32 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/123 places, 48/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1729 ms. Remains : 50/123 places, 48/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-05-30 13:08:38] [INFO ] Invariant cache hit.
[2024-05-30 13:08:38] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-30 13:08:38] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-30 13:08:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:08:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-30 13:08:39] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-30 13:08:39] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 13:08:39] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9345 reset in 285 ms.
Product exploration explored 100000 steps with 9365 reset in 197 ms.
Built C files in :
/tmp/ltsmin11822282772996712056
[2024-05-30 13:08:39] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-30 13:08:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:08:39] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-30 13:08:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:08:39] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-30 13:08:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:08:39] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11822282772996712056
Running compilation step : cd /tmp/ltsmin11822282772996712056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 652 ms.
Running link step : cd /tmp/ltsmin11822282772996712056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11822282772996712056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13953767572799961024.hoa' '--buchi-type=spotba'
LTSmin run took 1091 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 finished in 18908 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 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions (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 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 21 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2024-05-30 13:08:41] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:08:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:08:41] [INFO ] Invariant cache hit.
[2024-05-30 13:08:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-30 13:08:41] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-30 13:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1767 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3903ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4061 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 456 ms.
Stack based approach found an accepted trace after 1019 steps with 0 reset with depth 1020 and stack size 1018 in 6 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 finished in 4583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 13:08:46] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 13:08:46] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 13:08:46] [INFO ] Invariant cache hit.
[2024-05-30 13:08:46] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6557 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7199 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 13888ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13892ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14164 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 finished in 14269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X((p0 U p1))))))'
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 5 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:09:00] [INFO ] Invariant cache hit.
[2024-05-30 13:09:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:09:00] [INFO ] Invariant cache hit.
[2024-05-30 13:09:00] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6481 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8878 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 15492ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15495ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15732 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 41 steps with 8 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 finished in 15989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:09:16] [INFO ] Invariant cache hit.
[2024-05-30 13:09:16] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-30 13:09:16] [INFO ] Invariant cache hit.
[2024-05-30 13:09:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:09:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5887 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8801 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 14767ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14770ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15039 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 181 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 finished in 15550 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 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 83 transition count 112
Applied a total of 128 rules in 16 ms. Remains 83 /139 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-30 13:09:32] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:09:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 13:09:32] [INFO ] Invariant cache hit.
[2024-05-30 13:09:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-30 13:09:32] [INFO ] Redundant transitions in 4 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-30 13:09:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2932 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 5521ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 5524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/139 places, 112/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5750 ms. Remains : 83/139 places, 112/184 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 727 ms.
Stack based approach found an accepted trace after 1434 steps with 0 reset with depth 1435 and stack size 1435 in 15 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 finished in 6573 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)||(!p0&&F(!p1))) U X(X(!p2))) U p1))'
Support contains 64 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-05-30 13:09:38] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 13:09:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 13:09:38] [INFO ] Invariant cache hit.
[2024-05-30 13:09:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 13:09:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7527 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8388 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15988ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15991ms
Finished structural reductions in LTL mode , in 1 iterations and 16208 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 494 ms :[(NOT p1), p2, p2, p2, true, p2, p2, (AND p1 p2 p0), (AND p1 p0 p2), (AND p1 p2), p1, (AND p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 finished in 16739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 13:09:55] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:09:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 13:09:55] [INFO ] Invariant cache hit.
[2024-05-30 13:09:55] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5908 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7526 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 13503ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13505ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13791 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 finished in 14256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:10:09] [INFO ] Invariant cache hit.
[2024-05-30 13:10:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 13:10:09] [INFO ] Invariant cache hit.
[2024-05-30 13:10:09] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6447 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8728 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 15246ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15248ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15488 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 finished in 15623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:10:25] [INFO ] Invariant cache hit.
[2024-05-30 13:10:25] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-30 13:10:25] [INFO ] Invariant cache hit.
[2024-05-30 13:10:25] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:10:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7135 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7983 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 15247ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15251ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15565 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 finished in 15660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!p0||G(F(!p1)))) U p2)))'
Support contains 43 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 7 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 13:10:40] [INFO ] Invariant cache hit.
[2024-05-30 13:10:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:10:40] [INFO ] Invariant cache hit.
[2024-05-30 13:10:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-30 13:10:41] [INFO ] Redundant transitions in 5 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-30 13:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6069 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6421 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 12558ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12766 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-14
Product exploration explored 100000 steps with 7677 reset in 280 ms.
Product exploration explored 100000 steps with 7785 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 331 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
RANDOM walk for 218 steps (0 resets) in 17 ms. (12 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 649 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
[2024-05-30 13:10:56] [INFO ] Invariant cache hit.
[2024-05-30 13:10:56] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-30 13:10:56] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-30 13:10:56] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-30 13:10:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:10:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-30 13:10:56] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-30 13:10:56] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 13:10:56] [INFO ] Added : 20 causal constraints over 4 iterations in 99 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 43 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-30 13:10:56] [INFO ] Invariant cache hit.
[2024-05-30 13:10:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:10:56] [INFO ] Invariant cache hit.
[2024-05-30 13:10:56] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-30 13:10:56] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-30 13:10:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6086 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8460 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 14624ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14828 ms. Remains : 123/123 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 282 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
RANDOM walk for 236 steps (0 resets) in 6 ms. (33 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 624 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
[2024-05-30 13:11:13] [INFO ] Invariant cache hit.
[2024-05-30 13:11:13] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-30 13:11:13] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-30 13:11:13] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 13:11:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:11:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-30 13:11:13] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-30 13:11:13] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 13:11:13] [INFO ] Added : 20 causal constraints over 4 iterations in 96 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (AND p0 p1), (NOT p2), (AND p0 p1)]
Product exploration explored 100000 steps with 7870 reset in 271 ms.
Product exploration explored 100000 steps with 7864 reset in 287 ms.
Built C files in :
/tmp/ltsmin7067596848266433875
[2024-05-30 13:11:14] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-30 13:11:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:14] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-30 13:11:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:14] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-30 13:11:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:14] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7067596848266433875
Running compilation step : cd /tmp/ltsmin7067596848266433875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 984 ms.
Running link step : cd /tmp/ltsmin7067596848266433875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7067596848266433875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6412188254391775699.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 43 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-30 13:11:29] [INFO ] Invariant cache hit.
[2024-05-30 13:11:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 13:11:29] [INFO ] Invariant cache hit.
[2024-05-30 13:11:29] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-30 13:11:29] [INFO ] Redundant transitions in 2 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-30 13:11:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5435 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8868 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 14371ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14375ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14604 ms. Remains : 123/123 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin16319130860891983672
[2024-05-30 13:11:44] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-30 13:11:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:44] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-30 13:11:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:44] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-30 13:11:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:11:44] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16319130860891983672
Running compilation step : cd /tmp/ltsmin16319130860891983672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 869 ms.
Running link step : cd /tmp/ltsmin16319130860891983672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16319130860891983672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13427116384201831092.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:11:59] [INFO ] Flatten gal took : 21 ms
[2024-05-30 13:11:59] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:11:59] [INFO ] Time to serialize gal into /tmp/LTL6278962667895159581.gal : 9 ms
[2024-05-30 13:11:59] [INFO ] Time to serialize properties into /tmp/LTL12606559676469979432.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6278962667895159581.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11441021832859964262.hoa' '-atoms' '/tmp/LTL12606559676469979432.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12606559676469979432.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11441021832859964262.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 13:12:14] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:12:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:12:14] [INFO ] Time to serialize gal into /tmp/LTL8216503732819899568.gal : 3 ms
[2024-05-30 13:12:14] [INFO ] Time to serialize properties into /tmp/LTL17318246745911814758.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8216503732819899568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17318246745911814758.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F((!("(((((Assigned_6>=1)||(Assigned_7>=1))||((Assigned_8>=1)||(Assigned_9>=1)))||(((Assigned_10>=1)||(Assigned_11>=1))||((Assig...2435
Formula 0 simplified : F(G("(((((Assigned_6>=1)||(Assigned_7>=1))||((Assigned_8>=1)||(Assigned_9>=1)))||(((Assigned_10>=1)||(Assigned_11>=1))||((Assigned_1...2418
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 13:12:29] [INFO ] Flatten gal took : 18 ms
[2024-05-30 13:12:29] [INFO ] Applying decomposition
[2024-05-30 13:12:29] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15374530008699303446.txt' '-o' '/tmp/graph15374530008699303446.bin' '-w' '/tmp/graph15374530008699303446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15374530008699303446.bin' '-l' '-1' '-v' '-w' '/tmp/graph15374530008699303446.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:12:29] [INFO ] Decomposing Gal with order
[2024-05-30 13:12:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:12:30] [INFO ] Removed a total of 188 redundant transitions.
[2024-05-30 13:12:30] [INFO ] Flatten gal took : 81 ms
[2024-05-30 13:12:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 24 ms.
[2024-05-30 13:12:30] [INFO ] Time to serialize gal into /tmp/LTL16044678568726825422.gal : 11 ms
[2024-05-30 13:12:30] [INFO ] Time to serialize properties into /tmp/LTL863749858851565539.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16044678568726825422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL863749858851565539.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F((!("(((((i6.i0.u14.Assigned_6>=1)||(i6.i0.u15.Assigned_7>=1))||((i7.u7.Assigned_8>=1)||(i7.u8.Assigned_9>=1)))||(((i1.i0.u9.As...3583
Formula 0 simplified : F(G("(((((i6.i0.u14.Assigned_6>=1)||(i6.i0.u15.Assigned_7>=1))||((i7.u7.Assigned_8>=1)||(i7.u8.Assigned_9>=1)))||(((i1.i0.u9.Assigne...3566
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 finished in 124400 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)&&(G(p1) U G((!p0&&X(!p2))))))'
Support contains 43 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Applied a total of 80 rules in 12 ms. Remains 107 /139 variables (removed 32) and now considering 136/184 (removed 48) transitions.
// Phase 1: matrix 136 rows 107 cols
[2024-05-30 13:12:45] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 13:12:45] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 13:12:45] [INFO ] Invariant cache hit.
[2024-05-30 13:12:45] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-30 13:12:45] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-30 13:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5267 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 128/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 253 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5823 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 11158ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/139 places, 136/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11447 ms. Remains : 107/139 places, 136/184 transitions.
Stuttering acceptance computed with spot in 360 ms :[true, true, (OR p2 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p2, (OR p2 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-15
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 finished in 11834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!p0||G(F(!p1)))) U p2)))'
[2024-05-30 13:12:57] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12634495049829791677
[2024-05-30 13:12:57] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2024-05-30 13:12:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:12:57] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2024-05-30 13:12:57] [INFO ] Applying decomposition
[2024-05-30 13:12:57] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:12:57] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:12:57] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2024-05-30 13:12:57] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:12:57] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12634495049829791677
Running compilation step : cd /tmp/ltsmin12634495049829791677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7303811795897555501.txt' '-o' '/tmp/graph7303811795897555501.bin' '-w' '/tmp/graph7303811795897555501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7303811795897555501.bin' '-l' '-1' '-v' '-w' '/tmp/graph7303811795897555501.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:12:57] [INFO ] Decomposing Gal with order
[2024-05-30 13:12:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:12:57] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-30 13:12:57] [INFO ] Flatten gal took : 34 ms
[2024-05-30 13:12:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 12 ms.
[2024-05-30 13:12:57] [INFO ] Time to serialize gal into /tmp/LTLFireability7890219112088096863.gal : 7 ms
[2024-05-30 13:12:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3701162374821224122.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7890219112088096863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3701162374821224122.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F((!("(((((i5.i1.u10.Assigned_6>=1)||(i5.i1.u11.Assigned_7>=1))||((i1.i0.u24.Assigned_8>=1)||(i1.i0.u12.Assigned_9>=1)))||(((i2....3595
Formula 0 simplified : F(G("(((((i5.i1.u10.Assigned_6>=1)||(i5.i1.u11.Assigned_7>=1))||((i1.i0.u24.Assigned_8>=1)||(i1.i0.u12.Assigned_9>=1)))||(((i2.i0.u1...3578
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 888 ms.
Running link step : cd /tmp/ltsmin12634495049829791677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12634495049829791677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((!(LTLAPp0==true)||[](<>(!(LTLAPp1==true))))) U (LTLAPp2==true)))' '--buchi-type=spotba'
104 unique states visited
0 strongly connected components in search stack
160 transitions explored
58 items max in DFS search stack
2723 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,27.2521,514792,1,0,1.01117e+06,667,2107,1.00784e+06,212,2678,1294541
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 380484 ms.
BK_STOP 1717074845338
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T4N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z2T4N08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r444-smll-171701110700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N08.tgz
mv UtilityControlRoom-COL-Z2T4N08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;