About the Execution of ITS-Tools for UtilityControlRoom-COL-Z2T4N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1997.256 | 602776.00 | 1019317.00 | 1971.50 | FFFFTFFFFFTFTFFT | 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-171701110700076.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-Z2T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110700076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.2K Apr 13 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 05:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 05:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 13 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 13 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717075714390
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-Z2T4N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 13:28:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:28:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:28:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 13:28:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 13:28:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 923 ms
[2024-05-30 13:28:37] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 13:28:37] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 13:28:37] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 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 623 steps (0 resets) in 47 ms. (12 steps per ms) remains 0/9 properties
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 13:28:38] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 40 ms.
[2024-05-30 13:28:38] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-30 13:28:38] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 13:28:38] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 13:28:38] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 13:28:38] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 113 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 42 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 13:28:38] [INFO ] Computed 23 invariants in 38 ms
[2024-05-30 13:28:38] [INFO ] Implicit Places using invariants in 447 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 153/174 places, 210/230 transitions.
Support contains 113 out of 153 places after structural reductions.
[2024-05-30 13:28:39] [INFO ] Flatten gal took : 57 ms
[2024-05-30 13:28:39] [INFO ] Flatten gal took : 72 ms
[2024-05-30 13:28:39] [INFO ] Input system was already deterministic with 210 transitions.
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 147 steps (0 resets) in 42 ms. (3 steps per ms) remains 0/11 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:28:40] [INFO ] Computed 22 invariants in 4 ms
[2024-05-30 13:28:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 13:28:40] [INFO ] Invariant cache hit.
[2024-05-30 13:28:40] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10008 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 20361ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 20383ms
Finished structural reductions in LTL mode , in 1 iterations and 20732 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-01 finished in 21026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((X(!p1) U (X(G(!p1))||(!p2&&X(!p1))))&&p0))))))'
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:29:01] [INFO ] Invariant cache hit.
[2024-05-30 13:29:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 13:29:01] [INFO ] Invariant cache hit.
[2024-05-30 13:29:01] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:29:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10087 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11729 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22050ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22056ms
Finished structural reductions in LTL mode , in 1 iterations and 22318 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-03 finished in 22573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 113 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 112 transition count 130
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 111 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 113 place count 101 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 123 place count 101 transition count 110
Applied a total of 123 rules in 60 ms. Remains 101 /153 variables (removed 52) and now considering 110/210 (removed 100) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-05-30 13:29:23] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:29:23] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 13:29:23] [INFO ] Invariant cache hit.
[2024-05-30 13:29:23] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-30 13:29:23] [INFO ] Redundant transitions in 5 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 13:29:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3048 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 6457ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/153 places, 110/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6807 ms. Remains : 101/153 places, 110/210 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-04
Product exploration explored 100000 steps with 6682 reset in 701 ms.
Product exploration explored 100000 steps with 6653 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-30 13:29:31] [INFO ] Invariant cache hit.
[2024-05-30 13:29:32] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-30 13:29:32] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-30 13:29:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:29:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-30 13:29:32] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-30 13:29:32] [INFO ] Computed and/alt/rep : 90/150/90 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 13:29:32] [INFO ] Added : 56 causal constraints over 12 iterations in 236 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 13 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-30 13:29:32] [INFO ] Invariant cache hit.
[2024-05-30 13:29:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-30 13:29:32] [INFO ] Invariant cache hit.
[2024-05-30 13:29:33] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-30 13:29:33] [INFO ] Redundant transitions in 4 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 13:29:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2925 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3332 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 6305ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6307ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6656 ms. Remains : 101/101 places, 110/110 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2024-05-30 13:29:39] [INFO ] Invariant cache hit.
[2024-05-30 13:29:39] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-30 13:29:39] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-30 13:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:29:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-30 13:29:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-30 13:29:40] [INFO ] Computed and/alt/rep : 90/150/90 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 13:29:40] [INFO ] Added : 56 causal constraints over 12 iterations in 220 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6694 reset in 413 ms.
Product exploration explored 100000 steps with 6678 reset in 489 ms.
Built C files in :
/tmp/ltsmin2025368632924056909
[2024-05-30 13:29:41] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-30 13:29:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:29:41] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-30 13:29:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:29:41] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-30 13:29:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:29:41] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2025368632924056909
Running compilation step : cd /tmp/ltsmin2025368632924056909;'/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 851 ms.
Running link step : cd /tmp/ltsmin2025368632924056909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 219 ms.
Running LTSmin : cd /tmp/ltsmin2025368632924056909;'/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/stateBased15200676233764222860.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-30 13:29:56] [INFO ] Invariant cache hit.
[2024-05-30 13:29:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 13:29:56] [INFO ] Invariant cache hit.
[2024-05-30 13:29:56] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-30 13:29:56] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 13:29:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3099 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 6431ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6633 ms. Remains : 101/101 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin308211769268044991
[2024-05-30 13:30:03] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-30 13:30:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:30:03] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-30 13:30:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:30:03] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-30 13:30:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:30:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin308211769268044991
Running compilation step : cd /tmp/ltsmin308211769268044991;'/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 569 ms.
Running link step : cd /tmp/ltsmin308211769268044991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin308211769268044991;'/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/stateBased10945505146509490048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:30:18] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:30:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:30:18] [INFO ] Time to serialize gal into /tmp/LTL6994561307571710562.gal : 4 ms
[2024-05-30 13:30:18] [INFO ] Time to serialize properties into /tmp/LTL16171738770872825714.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6994561307571710562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17704790572891101290.hoa' '-atoms' '/tmp/LTL16171738770872825714.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16171738770872825714.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17704790572891101290.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
74 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.774416,33336,1,0,115,118824,17,24,2336,75839,233
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-04 finished in 55665 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(p1)))'
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:30:19] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 13:30:19] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-30 13:30:19] [INFO ] Invariant cache hit.
[2024-05-30 13:30:19] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10540 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12795 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23531ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23535ms
Finished structural reductions in LTL mode , in 1 iterations and 23947 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-05 finished in 24208 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)||(X(G(!p2))&&p1))))'
Support contains 73 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 143 transition count 200
Applied a total of 20 rules in 16 ms. Remains 143 /153 variables (removed 10) and now considering 200/210 (removed 10) transitions.
// Phase 1: matrix 200 rows 143 cols
[2024-05-30 13:30:43] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 13:30:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 13:30:43] [INFO ] Invariant cache hit.
[2024-05-30 13:30:43] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-30 13:30:43] [INFO ] Redundant transitions in 14 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-30 13:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 165 constraints, problems are : Problem set: 0 solved, 170 unsolved in 8613 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 170/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 335 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 18832ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 18837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/153 places, 200/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19072 ms. Remains : 143/153 places, 200/210 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 1269 ms.
Stack based approach found an accepted trace after 3864 steps with 0 reset with depth 3865 and stack size 3865 in 54 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-06 finished in 20539 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))))'
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:31:04] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 13:31:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 13:31:04] [INFO ] Invariant cache hit.
[2024-05-30 13:31:04] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:31:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10589 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12385 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23152ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23157ms
Finished structural reductions in LTL mode , in 1 iterations and 23586 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 248 steps with 80 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-07 finished in 23840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&G(p1))))))))'
Support contains 50 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:31:27] [INFO ] Invariant cache hit.
[2024-05-30 13:31:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 13:31:27] [INFO ] Invariant cache hit.
[2024-05-30 13:31:28] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:31:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10618 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11667 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22417ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22420ms
Finished structural reductions in LTL mode , in 1 iterations and 22681 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 789 ms.
Stack based approach found an accepted trace after 4601 steps with 0 reset with depth 4602 and stack size 4602 in 44 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-08 finished in 23792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)&&X(F(p2))))))'
Support contains 53 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:31:51] [INFO ] Invariant cache hit.
[2024-05-30 13:31:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 13:31:51] [INFO ] Invariant cache hit.
[2024-05-30 13:31:51] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10178 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11535 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 21897ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21902ms
Finished structural reductions in LTL mode , in 1 iterations and 22214 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-09
Product exploration explored 100000 steps with 463 reset in 479 ms.
Stack based approach found an accepted trace after 97119 steps with 546 reset with depth 618 and stack size 618 in 547 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-09 finished in 23531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X((F(p0)||(p1 U X(G(p1)))))))))'
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:32:15] [INFO ] Invariant cache hit.
[2024-05-30 13:32:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 13:32:15] [INFO ] Invariant cache hit.
[2024-05-30 13:32:15] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10558 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11849 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22603ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22607ms
Finished structural reductions in LTL mode , in 1 iterations and 22953 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-10
Product exploration explored 100000 steps with 8375 reset in 576 ms.
Product exploration explored 100000 steps with 8369 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 50 steps (0 resets) in 9 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 13:32:40] [INFO ] Invariant cache hit.
[2024-05-30 13:32:41] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2024-05-30 13:32:41] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-30 13:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:32:42] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-30 13:32:42] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-30 13:32:42] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 13:32:42] [INFO ] Added : 56 causal constraints over 12 iterations in 368 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:32:42] [INFO ] Invariant cache hit.
[2024-05-30 13:32:42] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 13:32:42] [INFO ] Invariant cache hit.
[2024-05-30 13:32:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:32:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10643 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10729 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 21546ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21550ms
Finished structural reductions in LTL mode , in 1 iterations and 21943 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 34 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 456 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-30 13:33:06] [INFO ] Invariant cache hit.
[2024-05-30 13:33:06] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-30 13:33:07] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-30 13:33:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:33:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-05-30 13:33:07] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-30 13:33:07] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-30 13:33:08] [INFO ] Added : 56 causal constraints over 12 iterations in 376 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 8446 reset in 586 ms.
Product exploration explored 100000 steps with 8428 reset in 424 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 17 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:33:10] [INFO ] Redundant transitions in 5 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-30 13:33:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10344 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12880 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 23412ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23417ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23447 ms. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin7375980764458247472
[2024-05-30 13:33:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7375980764458247472
Running compilation step : cd /tmp/ltsmin7375980764458247472;'/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 821 ms.
Running link step : cd /tmp/ltsmin7375980764458247472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7375980764458247472;'/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/stateBased15812084282240095238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:33:48] [INFO ] Invariant cache hit.
[2024-05-30 13:33:48] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 13:33:48] [INFO ] Invariant cache hit.
[2024-05-30 13:33:48] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:33:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9952 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11155 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 21217ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21219ms
Finished structural reductions in LTL mode , in 1 iterations and 21456 ms. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin16997283610923407898
[2024-05-30 13:34:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16997283610923407898
Running compilation step : cd /tmp/ltsmin16997283610923407898;'/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 803 ms.
Running link step : cd /tmp/ltsmin16997283610923407898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16997283610923407898;'/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/stateBased14963976320562219693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:34:25] [INFO ] Flatten gal took : 20 ms
[2024-05-30 13:34:25] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:34:25] [INFO ] Time to serialize gal into /tmp/LTL9027561052416289047.gal : 4 ms
[2024-05-30 13:34:25] [INFO ] Time to serialize properties into /tmp/LTL5696532056240194986.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9027561052416289047.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4303493020993913223.hoa' '-atoms' '/tmp/LTL5696532056240194986.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5696532056240194986.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4303493020993913223.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 13:34:40] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:34:40] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:34:40] [INFO ] Time to serialize gal into /tmp/LTL2326583434241773611.gal : 3 ms
[2024-05-30 13:34:40] [INFO ] Time to serialize properties into /tmp/LTL15404086176147017447.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2326583434241773611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15404086176147017447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((((Assigned_0>=1)||(Assigned_1>=1))||((Assigned_2>=1)||(Assigned_3>=1)))||(((Assigned_4>=1)||(Assigned_5>=1))||((Assigned_...5432
Formula 0 simplified : XF(!"((((((Assigned_0>=1)||(Assigned_1>=1))||((Assigned_2>=1)||(Assigned_3>=1)))||(((Assigned_4>=1)||(Assigned_5>=1))||((Assigned_7>...5420
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 13:34:55] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:34:55] [INFO ] Applying decomposition
[2024-05-30 13:34:55] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11114981067417341644.txt' '-o' '/tmp/graph11114981067417341644.bin' '-w' '/tmp/graph11114981067417341644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11114981067417341644.bin' '-l' '-1' '-v' '-w' '/tmp/graph11114981067417341644.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:34:55] [INFO ] Decomposing Gal with order
[2024-05-30 13:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:34:55] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-30 13:34:55] [INFO ] Flatten gal took : 61 ms
[2024-05-30 13:34:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 20 ms.
[2024-05-30 13:34:55] [INFO ] Time to serialize gal into /tmp/LTL8855263109166366979.gal : 9 ms
[2024-05-30 13:34:55] [INFO ] Time to serialize properties into /tmp/LTL11129341878327828908.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8855263109166366979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11129341878327828908.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((((i7.u9.Assigned_0>=1)||(i7.u24.Assigned_1>=1))||((i8.i0.u16.Assigned_2>=1)||(i8.i0.u26.Assigned_3>=1)))||(((i2.i0.u17.As...8162
Formula 0 simplified : XF(!"((((((i7.u9.Assigned_0>=1)||(i7.u24.Assigned_1>=1))||((i8.i0.u16.Assigned_2>=1)||(i8.i0.u26.Assigned_3>=1)))||(((i2.i0.u17.Assi...8150
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
77 unique states visited
0 strongly connected components in search stack
77 transitions explored
41 items max in DFS search stack
933 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.36283,187392,1,0,313164,411,2453,335580,172,1193,382547
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-10 finished in 170780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 113 transition count 170
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 100 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 103 transition count 140
Applied a total of 120 rules in 15 ms. Remains 103 /153 variables (removed 50) and now considering 140/210 (removed 70) transitions.
// Phase 1: matrix 140 rows 103 cols
[2024-05-30 13:35:05] [INFO ] Computed 22 invariants in 0 ms
[2024-05-30 13:35:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 13:35:06] [INFO ] Invariant cache hit.
[2024-05-30 13:35:06] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-30 13:35:06] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-30 13:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3120 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5648 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 8831ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8832ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/153 places, 140/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9056 ms. Remains : 103/153 places, 140/210 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 578 ms.
Stack based approach found an accepted trace after 167 steps with 5 reset with depth 67 and stack size 67 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-11 finished in 9794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 140 place count 83 transition count 140
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 160 place count 83 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 82 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 82 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 172 place count 72 transition count 80
Iterating global reduction 1 with 10 rules applied. Total rules applied 182 place count 72 transition count 80
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 192 place count 62 transition count 70
Iterating global reduction 1 with 10 rules applied. Total rules applied 202 place count 62 transition count 70
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 212 place count 62 transition count 60
Applied a total of 212 rules in 22 ms. Remains 62 /153 variables (removed 91) and now considering 60/210 (removed 150) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-30 13:35:15] [INFO ] Computed 22 invariants in 0 ms
[2024-05-30 13:35:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 13:35:15] [INFO ] Invariant cache hit.
[2024-05-30 13:35:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-30 13:35:15] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-30 13:35:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 84 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 134 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 2695ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/153 places, 60/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2891 ms. Remains : 62/153 places, 60/210 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-12
Product exploration explored 100000 steps with 1965 reset in 341 ms.
Product exploration explored 100000 steps with 1918 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 229 steps (0 resets) in 7 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 13:35:20] [INFO ] Invariant cache hit.
[2024-05-30 13:35:20] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 13:35:20] [INFO ] Invariant cache hit.
[2024-05-30 13:35:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-30 13:35:20] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-30 13:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 84 constraints, problems are : Problem set: 0 solved, 50 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 134 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 2150ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2354 ms. Remains : 62/62 places, 60/60 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 138 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1916 reset in 345 ms.
Product exploration explored 100000 steps with 1934 reset in 343 ms.
Built C files in :
/tmp/ltsmin2526432274071001273
[2024-05-30 13:35:23] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-30 13:35:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:23] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-30 13:35:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:23] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-30 13:35:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2526432274071001273
Running compilation step : cd /tmp/ltsmin2526432274071001273;'/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 237 ms.
Running link step : cd /tmp/ltsmin2526432274071001273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2526432274071001273;'/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/stateBased13959887310650332778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 13:35:38] [INFO ] Invariant cache hit.
[2024-05-30 13:35:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:35:38] [INFO ] Invariant cache hit.
[2024-05-30 13:35:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-30 13:35:39] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-30 13:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 84 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 134 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2620ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2770 ms. Remains : 62/62 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin9896891374027228125
[2024-05-30 13:35:41] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-30 13:35:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:41] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-30 13:35:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:41] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-30 13:35:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:35:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9896891374027228125
Running compilation step : cd /tmp/ltsmin9896891374027228125;'/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 384 ms.
Running link step : cd /tmp/ltsmin9896891374027228125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9896891374027228125;'/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/stateBased15055141281086131740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:35:56] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:35:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:56] [INFO ] Time to serialize gal into /tmp/LTL4856859553595049835.gal : 1 ms
[2024-05-30 13:35:56] [INFO ] Time to serialize properties into /tmp/LTL8012413210753493463.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4856859553595049835.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16637083461849771897.hoa' '-atoms' '/tmp/LTL8012413210753493463.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8012413210753493463.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16637083461849771897.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
31 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.325257,25784,1,0,43,69898,24,1,1532,35316,109
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-12 finished in 41389 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)) U p0))'
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 93 transition count 150
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 140 place count 93 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 92 transition count 110
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 91 transition count 110
Applied a total of 143 rules in 13 ms. Remains 91 /153 variables (removed 62) and now considering 110/210 (removed 100) transitions.
// Phase 1: matrix 110 rows 91 cols
[2024-05-30 13:35:57] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:35:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:35:57] [INFO ] Invariant cache hit.
[2024-05-30 13:35:57] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-30 13:35:57] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 13:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2965 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 90/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 202 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 6357ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6359ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/153 places, 110/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6551 ms. Remains : 91/153 places, 110/210 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 353 ms.
Stack based approach found an accepted trace after 256 steps with 0 reset with depth 257 and stack size 257 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-13 finished in 6986 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)&&(G(p1) U p2)))))'
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:36:04] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 13:36:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 13:36:04] [INFO ] Invariant cache hit.
[2024-05-30 13:36:04] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9854 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11381 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 21370ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21373ms
Finished structural reductions in LTL mode , in 1 iterations and 21636 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 25 steps with 1 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-14 finished in 21858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F((p2&&F(p3)))||p1))))'
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:36:26] [INFO ] Invariant cache hit.
[2024-05-30 13:36:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 13:36:26] [INFO ] Invariant cache hit.
[2024-05-30 13:36:26] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:36:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10247 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11880 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22320ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22324ms
Finished structural reductions in LTL mode , in 1 iterations and 22598 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-15
Product exploration explored 100000 steps with 18991 reset in 667 ms.
Product exploration explored 100000 steps with 18903 reset in 598 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 p3) (NOT p2) (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 15 factoid took 402 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F p3)]
Knowledge based reduction with 15 factoid took 638 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 137 ms :[(NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (NOT p3), (NOT p3)]
[2024-05-30 13:36:51] [INFO ] Invariant cache hit.
[2024-05-30 13:36:52] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-05-30 13:36:52] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-30 13:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:36:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-30 13:36:53] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-30 13:36:53] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 13:36:53] [INFO ] Added : 110 causal constraints over 22 iterations in 592 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 23 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:36:53] [INFO ] Invariant cache hit.
[2024-05-30 13:36:53] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 13:36:53] [INFO ] Invariant cache hit.
[2024-05-30 13:36:54] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10553 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11659 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22396ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22400ms
Finished structural reductions in LTL mode , in 1 iterations and 22758 ms. Remains : 153/153 places, 210/210 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 p3)]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 1 factoid took 108 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 97 ms :[(NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p3)]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F p3)]
Knowledge based reduction with 1 factoid took 153 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 146 ms :[(NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (NOT p3)]
[2024-05-30 13:37:17] [INFO ] Invariant cache hit.
[2024-05-30 13:37:17] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-30 13:37:17] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-30 13:37:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 13:37:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-30 13:37:18] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-30 13:37:18] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 13:37:18] [INFO ] Added : 110 causal constraints over 22 iterations in 508 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 18929 reset in 564 ms.
Product exploration explored 100000 steps with 18971 reset in 476 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(NOT p3), (NOT p3), (NOT p3)]
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 153 transition count 210
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 60 rules in 17 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 13:37:20] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:37:20] [INFO ] Computed 22 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 10/153 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
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 TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
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
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 210/363 variables, 153/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 186 constraints, problems are : Problem set: 60 solved, 140 unsolved in 10450 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 60 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 50/153 variables, 22/23 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 210/363 variables, 153/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 140/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 326 constraints, problems are : Problem set: 60 solved, 140 unsolved in 8125 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 140/200 constraints, Known Traps: 11/11 constraints]
After SMT, in 18687ms problems are : Problem set: 60 solved, 140 unsolved
Search for dead transitions found 60 dead transitions in 18689ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 150/210 transitions.
Graph (complete) has 250 edges and 153 vertex of which 113 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 113 /153 variables (removed 40) and now considering 150/150 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/153 places, 150/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18721 ms. Remains : 113/153 places, 150/210 transitions.
Built C files in :
/tmp/ltsmin11423529889472456206
[2024-05-30 13:37:38] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11423529889472456206
Running compilation step : cd /tmp/ltsmin11423529889472456206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 585 ms.
Running link step : cd /tmp/ltsmin11423529889472456206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11423529889472456206;'/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/stateBased16966246391515827885.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 13:37:53] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 13:37:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 13:37:54] [INFO ] Invariant cache hit.
[2024-05-30 13:37:54] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9997 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12401 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22582ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22586ms
Finished structural reductions in LTL mode , in 1 iterations and 22839 ms. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin17987615906326419037
[2024-05-30 13:38:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17987615906326419037
Running compilation step : cd /tmp/ltsmin17987615906326419037;'/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 736 ms.
Running link step : cd /tmp/ltsmin17987615906326419037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17987615906326419037;'/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/stateBased16424680629562826308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:38:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:38:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:38:31] [INFO ] Time to serialize gal into /tmp/LTL2996760383868036478.gal : 2 ms
[2024-05-30 13:38:31] [INFO ] Time to serialize properties into /tmp/LTL17066036797252207031.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2996760383868036478.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13363469783066935945.hoa' '-atoms' '/tmp/LTL17066036797252207031.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17066036797252207031.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13363469783066935945.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
467 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.70494,137944,1,0,100,768143,17,20,3993,204783,200
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-15 finished in 131115 ms.
All properties solved by simple procedures.
Total runtime 600496 ms.
BK_STOP 1717076317166
--------------------
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-Z2T4N10"
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-Z2T4N10, 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-171701110700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N10.tgz
mv UtilityControlRoom-COL-Z2T4N10 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 ;