About the Execution of ITS-Tools for UtilityControlRoom-COL-Z4T4N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1446.636 | 1016050.00 | 1195802.00 | 3294.80 | TTFFFFTFTFFFFFFF | 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-171701110800132.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-Z4T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110800132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.3K Apr 13 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 06:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 13 06:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 06:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 06:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717096781219
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-Z4T4N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 19:19:43] [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 19:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 19:19:43] [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 19:19:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 19:19:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1232 ms
[2024-05-30 19:19:45] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 19:19:45] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 10 ms.
[2024-05-30 19:19:45] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 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 536 steps (0 resets) in 48 ms. (10 steps per ms) remains 0/9 properties
[2024-05-30 19:19:45] [INFO ] Flatten gal took : 32 ms
[2024-05-30 19:19:45] [INFO ] Flatten gal took : 7 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 19:19:45] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 62 ms.
[2024-05-30 19:19:45] [INFO ] Unfolded 13 HLPN properties in 6 ms.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 19:19:45] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 269 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 25 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-05-30 19:19:46] [INFO ] Computed 19 invariants in 47 ms
[2024-05-30 19:19:46] [INFO ] Implicit Places using invariants in 541 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 607 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 662 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2024-05-30 19:19:46] [INFO ] Flatten gal took : 77 ms
[2024-05-30 19:19:47] [INFO ] Flatten gal took : 103 ms
[2024-05-30 19:19:47] [INFO ] Input system was already deterministic with 472 transitions.
Reduction of identical properties reduced properties to check from 17 to 14
RANDOM walk for 387 steps (0 resets) in 57 ms. (6 steps per ms) remains 0/14 properties
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 37 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 40 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-30 19:19:47] [INFO ] Computed 18 invariants in 4 ms
[2024-05-30 19:19:48] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-30 19:19:48] [INFO ] Invariant cache hit.
[2024-05-30 19:19:48] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25354 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 56418ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 56460ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56989 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 572 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-00
Product exploration explored 100000 steps with 23608 reset in 854 ms.
Product exploration explored 100000 steps with 23708 reset in 738 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 14 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 19:20:47] [INFO ] Invariant cache hit.
[2024-05-30 19:20:48] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2024-05-30 19:20:49] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2024-05-30 19:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:20:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-30 19:20:50] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-30 19:20:50] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-30 19:20:52] [INFO ] Added : 280 causal constraints over 56 iterations in 2004 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-30 19:20:52] [INFO ] Invariant cache hit.
[2024-05-30 19:20:52] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 19:20:52] [INFO ] Invariant cache hit.
[2024-05-30 19:20:52] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25527 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 56489ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 56498ms
Finished structural reductions in LTL mode , in 1 iterations and 57030 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 19:21:50] [INFO ] Invariant cache hit.
[2024-05-30 19:21:50] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2024-05-30 19:21:51] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2024-05-30 19:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:21:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-30 19:21:52] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-30 19:21:52] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-30 19:21:54] [INFO ] Added : 280 causal constraints over 56 iterations in 1837 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23606 reset in 907 ms.
Product exploration explored 100000 steps with 23700 reset in 452 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 408
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 205 transition count 376
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 96 rules in 62 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-30 19:21:56] [INFO ] Redundant transitions in 28 ms returned []
Running 368 sub problems to find dead transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-30 19:21:56] [INFO ] Computed 18 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-30 19:21:59] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 34 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 8/205 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 19:22:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 8/27 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 376/581 variables, 205/232 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/232 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/581 variables, 0/232 constraints. Problems are: Problem set: 96 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 232 constraints, problems are : Problem set: 96 solved, 272 unsolved in 24705 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 96 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 72/205 variables, 18/19 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 8/27 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 376/581 variables, 205/232 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 272/504 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/504 constraints. Problems are: Problem set: 96 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/581 variables, 0/504 constraints. Problems are: Problem set: 96 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 504 constraints, problems are : Problem set: 96 solved, 272 unsolved in 27757 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 272/368 constraints, Known Traps: 9/9 constraints]
After SMT, in 52879ms problems are : Problem set: 96 solved, 272 unsolved
Search for dead transitions found 96 dead transitions in 52886ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 280/376 transitions.
Graph (complete) has 424 edges and 205 vertex of which 141 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 141 /205 variables (removed 64) and now considering 280/280 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/205 places, 280/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52998 ms. Remains : 141/205 places, 280/376 transitions.
Built C files in :
/tmp/ltsmin425205833435024448
[2024-05-30 19:22:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin425205833435024448
Running compilation step : cd /tmp/ltsmin425205833435024448;'/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 1343 ms.
Running link step : cd /tmp/ltsmin425205833435024448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin425205833435024448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5504690506779018871.hoa' '--buchi-type=spotba'
LTSmin run took 11568 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 finished in 194531 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) U (p1 U p2)))'
Support contains 205 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
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 0 with 16 rules applied. Total rules applied 16 place count 293 transition count 464
Applied a total of 16 rules in 32 ms. Remains 293 /301 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 293 cols
[2024-05-30 19:23:02] [INFO ] Computed 18 invariants in 5 ms
[2024-05-30 19:23:02] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 19:23:02] [INFO ] Invariant cache hit.
[2024-05-30 19:23:02] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-30 19:23:02] [INFO ] Redundant transitions in 9 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-30 19:23:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/293 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 464/757 variables, 293/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 311 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/293 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 464/757 variables, 293/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 424/735 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/757 variables, and 735 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60617ms
Starting structural reductions in SI_LTL mode, iteration 1 : 293/301 places, 464/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60991 ms. Remains : 293/301 places, 464/472 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-02
Product exploration explored 100000 steps with 21296 reset in 1611 ms.
Product exploration explored 100000 steps with 21386 reset in 1035 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 385 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 597 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p0)]
[2024-05-30 19:24:07] [INFO ] Invariant cache hit.
[2024-05-30 19:24:08] [INFO ] [Real]Absence check using 18 positive place invariants in 32 ms returned sat
[2024-05-30 19:24:09] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2024-05-30 19:24:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:24:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2024-05-30 19:24:10] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2024-05-30 19:24:10] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-30 19:24:15] [INFO ] Added : 424 causal constraints over 85 iterations in 4735 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 205 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 464/464 transitions.
Applied a total of 0 rules in 20 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-30 19:24:15] [INFO ] Invariant cache hit.
[2024-05-30 19:24:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 19:24:15] [INFO ] Invariant cache hit.
[2024-05-30 19:24:15] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-30 19:24:15] [INFO ] Redundant transitions in 7 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-30 19:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/293 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 464/757 variables, 293/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 311 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/293 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 464/757 variables, 293/311 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 424/735 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/757 variables, and 735 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60908ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61439 ms. Remains : 293/293 places, 464/464 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 (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 482 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p0)]
RANDOM walk for 87 steps (0 resets) in 13 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 599 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p0)]
[2024-05-30 19:25:18] [INFO ] Invariant cache hit.
[2024-05-30 19:25:19] [INFO ] [Real]Absence check using 18 positive place invariants in 31 ms returned sat
[2024-05-30 19:25:19] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2024-05-30 19:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:25:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2024-05-30 19:25:21] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-05-30 19:25:21] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-30 19:25:25] [INFO ] Added : 424 causal constraints over 85 iterations in 4220 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 21071 reset in 934 ms.
Product exploration explored 100000 steps with 21154 reset in 956 ms.
Built C files in :
/tmp/ltsmin11023816003175847064
[2024-05-30 19:25:27] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-30 19:25:27] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:27] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-30 19:25:27] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:27] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-30 19:25:27] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:27] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11023816003175847064
Running compilation step : cd /tmp/ltsmin11023816003175847064;'/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 2457 ms.
Running link step : cd /tmp/ltsmin11023816003175847064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11023816003175847064;'/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/stateBased5555029959622824787.hoa' '--buchi-type=spotba'
LTSmin run took 3564 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 finished in 151291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p0)&&G((X(p2)&&p1)))))))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Applied a total of 526 rules in 29 ms. Remains 66 /301 variables (removed 235) and now considering 64/472 (removed 408) transitions.
// Phase 1: matrix 64 rows 66 cols
[2024-05-30 19:25:33] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 19:25:33] [INFO ] Implicit Places using invariants in 91 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/301 places, 64/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 65/301 places, 64/472 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-03
Product exploration explored 100000 steps with 26959 reset in 434 ms.
Product exploration explored 100000 steps with 27156 reset in 706 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 24 factoid took 498 ms. Reduced automaton from 5 states, 30 edges and 3 AP (stutter insensitive) to 6 states, 36 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2), false]
Reduction of identical properties reduced properties to check from 16 to 9
RANDOM walk for 40000 steps (8 resets) in 1454 ms. (27 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
// Phase 1: matrix 64 rows 65 cols
[2024-05-30 19:25:36] [INFO ] Computed 17 invariants in 1 ms
Problem apf4 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 16/129 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/17 constraints, State Equation: 0/65 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR p0 (NOT p1)) (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 28 factoid took 1224 ms. Reduced automaton from 6 states, 36 edges and 3 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Support contains 16 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-30 19:25:38] [INFO ] Invariant cache hit.
[2024-05-30 19:25:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 19:25:38] [INFO ] Invariant cache hit.
[2024-05-30 19:25:38] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-30 19:25:38] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-30 19:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/65 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 82 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/65 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 56/138 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 138 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 2930ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2931ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3115 ms. Remains : 65/65 places, 64/64 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 p2 p0), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 431 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
RANDOM walk for 143 steps (0 resets) in 10 ms. (13 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 10 factoid took 779 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false]
Product exploration explored 100000 steps with 20823 reset in 434 ms.
Product exploration explored 100000 steps with 20814 reset in 399 ms.
Built C files in :
/tmp/ltsmin10826472497252881672
[2024-05-30 19:25:45] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-30 19:25:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:45] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-30 19:25:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:45] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-30 19:25:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:25:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10826472497252881672
Running compilation step : cd /tmp/ltsmin10826472497252881672;'/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 262 ms.
Running link step : cd /tmp/ltsmin10826472497252881672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10826472497252881672;'/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/stateBased2596744378854335344.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 finished in 12026 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 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 559 place count 49 transition count 48
Applied a total of 559 rules in 24 ms. Remains 49 /301 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 49 cols
[2024-05-30 19:25:45] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 19:25:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 19:25:45] [INFO ] Invariant cache hit.
[2024-05-30 19:25:45] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-30 19:25:45] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 19:25:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/97 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/97 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 66 constraints, problems are : Problem set: 0 solved, 40 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/97 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 40/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 106 constraints, problems are : Problem set: 0 solved, 40 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/301 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1821 ms. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 1277 steps with 0 reset with depth 1278 and stack size 1278 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 finished in 2104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(G(!p1))))&&F(G(p2)))))'
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2024-05-30 19:25:47] [INFO ] Computed 18 invariants in 7 ms
[2024-05-30 19:25:47] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 19:25:47] [INFO ] Invariant cache hit.
[2024-05-30 19:25:48] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-05-30 19:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 60577ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in LTL mode , in 1 iterations and 61106 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1189 ms.
Product exploration explored 100000 steps with 0 reset in 1009 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) p0 p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
[2024-05-30 19:26:52] [INFO ] Invariant cache hit.
[2024-05-30 19:26:53] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-30 19:26:53] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-30 19:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:26:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-30 19:26:55] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-05-30 19:26:55] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 62 ms.
[2024-05-30 19:26:58] [INFO ] Added : 296 causal constraints over 60 iterations in 3077 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-05-30 19:26:58] [INFO ] Invariant cache hit.
[2024-05-30 19:26:58] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-30 19:26:58] [INFO ] Invariant cache hit.
[2024-05-30 19:26:58] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-05-30 19:26:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 60959ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60970ms
Finished structural reductions in LTL mode , in 1 iterations and 61608 ms. Remains : 301/301 places, 472/472 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 8 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 5 factoid took 427 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
[2024-05-30 19:28:01] [INFO ] Invariant cache hit.
[2024-05-30 19:28:02] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-30 19:28:02] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-05-30 19:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-30 19:28:03] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-30 19:28:03] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 53 ms.
[2024-05-30 19:28:06] [INFO ] Added : 296 causal constraints over 60 iterations in 2972 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1209 ms.
Product exploration explored 100000 steps with 0 reset in 944 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (NOT p0)]
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 504
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 16 ms. Remains 301 /301 variables (removed 0) and now considering 504/472 (removed -32) transitions.
[2024-05-30 19:28:09] [INFO ] Redundant transitions in 3 ms returned []
Running 496 sub problems to find dead transitions.
// Phase 1: matrix 504 rows 301 cols
[2024-05-30 19:28:09] [INFO ] Computed 18 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-30 19:28:19] [INFO ] Deduced a trap composed of 202 places in 276 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 8/301 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-30 19:28:33] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 1/20 constraints. Problems are: Problem set: 8 solved, 488 unsolved
[2024-05-30 19:28:37] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 3 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 7/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/805 variables, and 27 constraints, problems are : Problem set: 64 solved, 432 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 64 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 1/1 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/1 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 40/301 variables, 18/19 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 8/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 504/805 variables, 301/328 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 432/760 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/760 constraints. Problems are: Problem set: 64 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 760 constraints, problems are : Problem set: 64 solved, 432 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 432/496 constraints, Known Traps: 9/9 constraints]
After SMT, in 60778ms problems are : Problem set: 64 solved, 432 unsolved
Search for dead transitions found 64 dead transitions in 60785ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 440/472 transitions.
Graph (complete) has 840 edges and 301 vertex of which 269 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 269 /301 variables (removed 32) and now considering 440/440 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 269/301 places, 440/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60824 ms. Remains : 269/301 places, 440/472 transitions.
Built C files in :
/tmp/ltsmin12415653153066473874
[2024-05-30 19:29:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12415653153066473874
Running compilation step : cd /tmp/ltsmin12415653153066473874;'/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 1591 ms.
Running link step : cd /tmp/ltsmin12415653153066473874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12415653153066473874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3306210284396630290.hoa' '--buchi-type=spotba'
LTSmin run took 218 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 finished in 204440 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((G(p1)||G(!p1)||p0))))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 17 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-30 19:29:12] [INFO ] Computed 18 invariants in 4 ms
[2024-05-30 19:29:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-30 19:29:12] [INFO ] Invariant cache hit.
[2024-05-30 19:29:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:29:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 22733 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 53232ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53240ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53764 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 102 ms :[false, false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 28 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 finished in 54514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 85 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 30 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-30 19:30:06] [INFO ] Invariant cache hit.
[2024-05-30 19:30:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-30 19:30:06] [INFO ] Invariant cache hit.
[2024-05-30 19:30:07] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:30:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 21509 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 52289ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 52296ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52704 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 finished in 52916 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((X(G(p1))||p0))&&F(G(p2))))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 13 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-30 19:30:59] [INFO ] Invariant cache hit.
[2024-05-30 19:30:59] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 19:30:59] [INFO ] Invariant cache hit.
[2024-05-30 19:31:00] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:31:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 26716 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 57658ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 57666ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58179 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 finished in 58431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U X(p1))&&(G(!p2)||X(G(p3))))))'
Support contains 48 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 10 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-30 19:31:58] [INFO ] Invariant cache hit.
[2024-05-30 19:31:58] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-30 19:31:58] [INFO ] Invariant cache hit.
[2024-05-30 19:31:58] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:31:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 27117 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 57971ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 57978ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58691 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (NOT p3), (NOT p1), (AND (NOT p3) p2), true, p2]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 finished in 59133 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 37 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 12 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-30 19:32:57] [INFO ] Invariant cache hit.
[2024-05-30 19:32:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 19:32:57] [INFO ] Invariant cache hit.
[2024-05-30 19:32:57] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:32:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 26593 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 57153ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 57158ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57702 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 finished in 57847 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((X(F(p0))||(X(p1)&&(p1 U X(!p2)))))))'
Support contains 85 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 12 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-30 19:33:55] [INFO ] Invariant cache hit.
[2024-05-30 19:33:55] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 19:33:55] [INFO ] Invariant cache hit.
[2024-05-30 19:33:55] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:33:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25627 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 56248ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 56255ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56690 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-12
Product exploration explored 100000 steps with 9965 reset in 479 ms.
Product exploration explored 100000 steps with 9938 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
RANDOM walk for 1367 steps (0 resets) in 16 ms. (80 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 714 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Support contains 85 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 173 transition count 344
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 173 transition count 312
Applied a total of 96 rules in 25 ms. Remains 173 /205 variables (removed 32) and now considering 312/376 (removed 64) transitions.
// Phase 1: matrix 312 rows 173 cols
[2024-05-30 19:34:54] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 19:34:54] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 19:34:54] [INFO ] Invariant cache hit.
[2024-05-30 19:34:55] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-30 19:34:55] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-30 19:34:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 312/485 variables, 173/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 191 constraints, problems are : Problem set: 0 solved, 304 unsolved in 15912 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 8/173 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 312/485 variables, 173/191 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 304/495 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 495 constraints, problems are : Problem set: 0 solved, 304 unsolved in 22346 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints]
After SMT, in 38789ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 38795ms
Starting structural reductions in SI_LTL mode, iteration 1 : 173/205 places, 312/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39135 ms. Remains : 173/205 places, 312/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
RANDOM walk for 665 steps (0 resets) in 15 ms. (41 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 744 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Product exploration explored 100000 steps with 15911 reset in 1003 ms.
Product exploration explored 100000 steps with 15849 reset in 769 ms.
Built C files in :
/tmp/ltsmin2686855407908059107
[2024-05-30 19:35:37] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-05-30 19:35:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:35:37] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-05-30 19:35:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:35:37] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-05-30 19:35:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 19:35:37] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2686855407908059107
Running compilation step : cd /tmp/ltsmin2686855407908059107;'/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 1430 ms.
Running link step : cd /tmp/ltsmin2686855407908059107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2686855407908059107;'/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/stateBased2820167656707652409.hoa' '--buchi-type=spotba'
LTSmin run took 1303 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 finished in 105359 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 109 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-30 19:35:40] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 19:35:40] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 19:35:40] [INFO ] Invariant cache hit.
[2024-05-30 19:35:40] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-30 19:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25301 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 56135ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 56143ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56509 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR p0 (AND p1 (NOT p2))), p0, (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 finished in 56729 ms.
All properties solved by simple procedures.
Total runtime 1013568 ms.
BK_STOP 1717097797269
--------------------
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-Z4T4N08"
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-Z4T4N08, 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-171701110800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N08.tgz
mv UtilityControlRoom-COL-Z4T4N08 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 ;