About the Execution of ITS-Tools for UtilityControlRoom-COL-Z4T3N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?FFFFTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590300715.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T3N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590300715
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.2K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 29K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749265654357
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-07 03:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 03:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 03:07:35] [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.
[2025-06-07 03:07:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 03:07:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2025-06-07 03:07:36] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 03:07:36] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2025-06-07 03:07:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 926 steps (0 resets) in 50 ms. (18 steps per ms) remains 0/22 properties
[2025-06-07 03:07:36] [INFO ] Flatten gal took : 15 ms
[2025-06-07 03:07:36] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 03:07:36] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 26 ms.
[2025-06-07 03:07:36] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 294 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 9 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 03:07:37] [INFO ] Computed 19 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:07:37] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-07 03:07:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:07:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 03:07:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 464/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 785 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Finished structural reductions in LTL mode , in 1 iterations and 61014 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2025-06-07 03:08:38] [INFO ] Flatten gal took : 74 ms
[2025-06-07 03:08:38] [INFO ] Flatten gal took : 47 ms
[2025-06-07 03:08:38] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (8 resets) in 1181 ms. (33 steps per ms) remains 0/22 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((F(p0) U X(p1)) U X(!p0))))))'
Support contains 40 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 19 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 03:08:39] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:08:39] [INFO ] Implicit Places using invariants in 244 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 380 ms :[p0, p0, p0, p0, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00
Product exploration explored 100000 steps with 2505 reset in 504 ms.
Product exploration explored 100000 steps with 2508 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[p0, p0, p0, p0, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 357 ms. (111 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 03:08:41] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 205/581 variables, and 18 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
[2025-06-07 03:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p0
Knowledge obtained : [(AND p0 p1), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 finished in 2845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&X(p1))) U (X(X(p2))||G(p1)))))'
Support contains 80 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 10 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 03:08:41] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:08:42] [INFO ] Implicit Places using invariants in 108 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01
Product exploration explored 100000 steps with 26666 reset in 279 ms.
Product exploration explored 100000 steps with 26721 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 291 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 12 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 568 ms. (70 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 03:08:44] [INFO ] Computed 18 invariants in 2 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 125/205 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 80/581 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/205 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (G (OR p0 p1 p2)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 13 factoid took 625 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 72 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-07 03:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:08:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 03:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:08:45] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 03:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25009 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55268ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55271ms
Finished structural reductions in LTL mode , in 1 iterations and 55503 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 35737 steps (8 resets) in 394 ms. (90 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p1)]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 24991 reset in 220 ms.
Product exploration explored 100000 steps with 24961 reset in 225 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 72 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 205 transition count 376
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 104 place count 205 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 202 transition count 248
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 202 transition count 248
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 134 place count 178 transition count 224
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 158 place count 178 transition count 224
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 158 rules in 53 ms. Remains 178 /205 variables (removed 27) and now considering 224/376 (removed 152) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 03:09:43] [INFO ] Redundant transitions in 14 ms returned []
Running 216 sub problems to find dead transitions.
// Phase 1: matrix 224 rows 178 cols
[2025-06-07 03:09:43] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:44] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 8/178 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 03:09:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem 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 TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 8/27 constraints. Problems are: Problem set: 42 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/27 constraints. Problems are: Problem set: 42 solved, 174 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 6 (OVERLAPS) 224/402 variables, 178/205 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/205 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/205 constraints. Problems are: Problem set: 48 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 205 constraints, problems are : Problem set: 48 solved, 168 unsolved in 10027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 56/178 variables, 18/19 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 8/27 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 224/402 variables, 178/205 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 168/373 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/373 constraints. Problems are: Problem set: 48 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/373 constraints. Problems are: Problem set: 48 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 373 constraints, problems are : Problem set: 48 solved, 168 unsolved in 11985 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 168/216 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22058ms problems are : Problem set: 48 solved, 168 unsolved
Search for dead transitions found 48 dead transitions in 22058ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 178/205 places, 176/376 transitions.
Graph (complete) has 328 edges and 178 vertex of which 130 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 11 ms. Remains 129 /178 variables (removed 49) and now considering 176/176 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/205 places, 176/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22163 ms. Remains : 129/205 places, 176/376 transitions.
Built C files in :
/tmp/ltsmin4807186646821123611
[2025-06-07 03:10:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4807186646821123611
Running compilation step : cd /tmp/ltsmin4807186646821123611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 703 ms.
Running link step : cd /tmp/ltsmin4807186646821123611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4807186646821123611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11432609094681796332.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 72 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 03:10:20] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:10:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-07 03:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:10:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 03:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25383 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55546ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55547ms
Finished structural reductions in LTL mode , in 1 iterations and 55779 ms. Remains : 205/205 places, 376/376 transitions.
Built C files in :
/tmp/ltsmin7758493417700993695
[2025-06-07 03:11:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7758493417700993695
Running compilation step : cd /tmp/ltsmin7758493417700993695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 523 ms.
Running link step : cd /tmp/ltsmin7758493417700993695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7758493417700993695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7794259155315578152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 03:11:31] [INFO ] Flatten gal took : 23 ms
[2025-06-07 03:11:31] [INFO ] Flatten gal took : 21 ms
[2025-06-07 03:11:31] [INFO ] Time to serialize gal into /tmp/LTL12944800489414835477.gal : 4 ms
[2025-06-07 03:11:31] [INFO ] Time to serialize properties into /tmp/LTL17664679382681843902.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12944800489414835477.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4927633046639630096.hoa' '-atoms' '/tmp/LTL17664679382681843902.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17664679382681843902.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4927633046639630096.hoa
Detected timeout of ITS tools.
[2025-06-07 03:11:46] [INFO ] Flatten gal took : 19 ms
[2025-06-07 03:11:46] [INFO ] Flatten gal took : 17 ms
[2025-06-07 03:11:46] [INFO ] Time to serialize gal into /tmp/LTL13331464478534015460.gal : 3 ms
[2025-06-07 03:11:46] [INFO ] Time to serialize properties into /tmp/LTL7294969011504984568.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13331464478534015460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7294969011504984568.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F((F("((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsW...1844
Formula 0 simplified : F(G(G!"((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsWait...1829
Detected timeout of ITS tools.
[2025-06-07 03:12:01] [INFO ] Flatten gal took : 17 ms
[2025-06-07 03:12:01] [INFO ] Applying decomposition
[2025-06-07 03:12:01] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12085826663873924321.txt' '-o' '/tmp/graph12085826663873924321.bin' '-w' '/tmp/graph12085826663873924321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12085826663873924321.bin' '-l' '-1' '-v' '-w' '/tmp/graph12085826663873924321.weights' '-q' '0' '-e' '0.001'
[2025-06-07 03:12:01] [INFO ] Decomposing Gal with order
[2025-06-07 03:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 03:12:01] [INFO ] Removed a total of 225 redundant transitions.
[2025-06-07 03:12:01] [INFO ] Flatten gal took : 217 ms
[2025-06-07 03:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 376 labels/synchronizations in 20 ms.
[2025-06-07 03:12:01] [INFO ] Time to serialize gal into /tmp/LTL11519651275731904237.gal : 4 ms
[2025-06-07 03:12:01] [INFO ] Time to serialize properties into /tmp/LTL8496589230350244636.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11519651275731904237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8496589230350244636.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F((F("((((gi2.gu10.ClientsWaiting_0+gi2.gu10.ClientsWaiting_1)+(gi2.gu10.ClientsWaiting_2+gi2.gu10.ClientsWaiting_3))+((gi2.gu10...2388
Formula 0 simplified : F(G(G!"((((gi2.gu10.ClientsWaiting_0+gi2.gu10.ClientsWaiting_1)+(gi2.gu10.ClientsWaiting_2+gi2.gu10.ClientsWaiting_3))+((gi2.gu10.Cl...2373
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01 finished in 215071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1) U p2)&&(F(p3) U (!p3&&X(p4))))))'
Support contains 244 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 03:12:17] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:12:17] [INFO ] Implicit Places using invariants in 172 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p4) p3), (OR (NOT p2) (NOT p4) p3), true, (NOT p1), (NOT p2), (OR (NOT p4) p3), (NOT p4), (NOT p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07
Product exploration explored 100000 steps with 8038 reset in 377 ms.
Product exploration explored 100000 steps with 7773 reset in 387 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 p2 (NOT p1) p0 (NOT p3) (NOT p4)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p3)), (X (NOT (OR (AND p2 p3) (AND p1 p3) (AND p0 p3)))), (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 19 factoid took 303 ms. Reduced automaton from 8 states, 18 edges and 5 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p4), (NOT p4), (OR (NOT p4) p3), (NOT p4), (NOT p3)]
RANDOM walk for 58 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1) p0 (NOT p3) (NOT p4)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p3)), (X (NOT (OR (AND p2 p3) (AND p1 p3) (AND p0 p3)))), (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p3) (NOT p4)))), (F p3), (F (NOT (OR (NOT p3) p4))), (F p4)]
Knowledge based reduction with 19 factoid took 435 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p4), (NOT p4), (OR (NOT p4) p3), (NOT p4), (NOT p3)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p4), (NOT p4), (OR (NOT p4) p3), (NOT p4), (NOT p3)]
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 03:12:19] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 03:12:20] [INFO ] [Real]Absence check using 18 positive place invariants in 304 ms returned unsat
Proved EG (NOT p4)
Knowledge obtained : [(AND p2 (NOT p1) p0 (NOT p3) (NOT p4)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p3)), (X (NOT (OR (AND p2 p3) (AND p1 p3) (AND p0 p3)))), (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p3) (NOT p4)))), (F p3), (F (NOT (OR (NOT p3) p4))), (F p4), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 19 factoid took 479 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 finished in 3623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)&&X(F(p2))))'
Support contains 73 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 7 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 03:12:20] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:12:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-07 03:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:12:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 03:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25172 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55345ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55346ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55648 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08
Product exploration explored 100000 steps with 16533 reset in 280 ms.
Product exploration explored 100000 steps with 16506 reset in 277 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 134 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 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
[2025-06-07 03:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 03:13:17] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 finished in 57179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 384 place count 126 transition count 264
Applied a total of 384 rules in 48 ms. Remains 126 /302 variables (removed 176) and now considering 264/472 (removed 208) transitions.
// Phase 1: matrix 264 rows 126 cols
[2025-06-07 03:13:17] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:13:17] [INFO ] Implicit Places using invariants in 120 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/302 places, 264/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 125/302 places, 264/472 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09
Product exploration explored 100000 steps with 3843 reset in 336 ms.
Stack based approach found an accepted trace after 4755 steps with 187 reset with depth 21 and stack size 21 in 17 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 finished in 603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 36 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 384 place count 126 transition count 264
Applied a total of 384 rules in 24 ms. Remains 126 /302 variables (removed 176) and now considering 264/472 (removed 208) transitions.
[2025-06-07 03:13:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:13:18] [INFO ] Implicit Places using invariants in 102 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/302 places, 264/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 125/302 places, 264/472 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 436 ms.
Stack based approach found an accepted trace after 1941 steps with 0 reset with depth 1942 and stack size 1942 in 10 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(!p0)||(p1&&X(!p0)))) U X((p2&&X(!p1)))))))'
Support contains 177 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 03:13:19] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:13:19] [INFO ] Implicit Places using invariants in 384 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 403 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11
Product exploration explored 100000 steps with 18947 reset in 497 ms.
Product exploration explored 100000 steps with 18924 reset in 509 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 13 states, 35 edges and 3 AP (stutter sensitive) to 13 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
RANDOM walk for 30044 steps (8 resets) in 287 ms. (104 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 512 ms. Reduced automaton from 13 states, 35 edges and 3 AP (stutter sensitive) to 13 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 583 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Support contains 177 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 03:13:23] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:13:23] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-07 03:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:13:23] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 03:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 60668 ms. Remains : 301/301 places, 472/472 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 13 states, 35 edges and 3 AP (stutter sensitive) to 13 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
RANDOM walk for 26721 steps (6 resets) in 233 ms. (114 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 540 ms. Reduced automaton from 13 states, 35 edges and 3 AP (stutter sensitive) to 13 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 562 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p1, (AND p0 p1), (AND p0 p1), p0, (AND p1 p0 p2), p0, (AND p1 p0 p2)]
Product exploration explored 100000 steps with 18948 reset in 490 ms.
Product exploration explored 100000 steps with 18912 reset in 512 ms.
Built C files in :
/tmp/ltsmin9778329730488949849
[2025-06-07 03:14:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9778329730488949849
Running compilation step : cd /tmp/ltsmin9778329730488949849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 699 ms.
Running link step : cd /tmp/ltsmin9778329730488949849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9778329730488949849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14223484563475550780.hoa' '--buchi-type=spotba'
LTSmin run took 315 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11 finished in 70277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 164 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 286 transition count 456
Applied a total of 32 rules in 13 ms. Remains 286 /302 variables (removed 16) and now considering 456/472 (removed 16) transitions.
// Phase 1: matrix 456 rows 286 cols
[2025-06-07 03:14:29] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:14:29] [INFO ] Implicit Places using invariants in 302 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 305 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/302 places, 456/472 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 326 ms. Remains : 285/302 places, 456/472 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12
Product exploration explored 100000 steps with 755 reset in 725 ms.
Product exploration explored 100000 steps with 823 reset in 804 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 83 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 268 steps (0 resets) in 4 ms. (53 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 188 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Support contains 164 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 456/456 transitions.
Applied a total of 0 rules in 13 ms. Remains 285 /285 variables (removed 0) and now considering 456/456 (removed 0) transitions.
// Phase 1: matrix 456 rows 285 cols
[2025-06-07 03:14:31] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:14:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 03:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:14:32] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 03:14:32] [INFO ] Redundant transitions in 23 ms returned []
Running 424 sub problems to find dead transitions.
[2025-06-07 03:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/285 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/741 variables, 285/303 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/741 variables, and 303 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/285 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/741 variables, 285/303 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 424/727 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/741 variables, and 727 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60574 ms. Remains : 285/285 places, 456/456 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) p1), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 81 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 163 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 233 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 804 reset in 659 ms.
Stack based approach found an accepted trace after 9777 steps with 88 reset with depth 155 and stack size 155 in 72 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 finished in 64397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X((F(G(p0)) U G(p1)))) U (p1&&(p0||X((F(G(p0)) U G(p1))))))))'
Support contains 48 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 3 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 03:15:33] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:15:33] [INFO ] Implicit Places using invariants in 193 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 378 ms.
Stack based approach found an accepted trace after 69127 steps with 0 reset with depth 69128 and stack size 37518 in 315 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p1||F(p2))))'
Support contains 49 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 374 place count 131 transition count 176
Applied a total of 374 rules in 15 ms. Remains 131 /302 variables (removed 171) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 131 cols
[2025-06-07 03:15:34] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 03:15:34] [INFO ] Implicit Places using invariants in 152 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/302 places, 176/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 130/302 places, 176/472 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15
Product exploration explored 100000 steps with 1520 reset in 270 ms.
Stack based approach found an accepted trace after 1534 steps with 24 reset with depth 101 and stack size 101 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&X(p1))) U (X(X(p2))||G(p1)))))'
[2025-06-07 03:15:35] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16329758180921125470
[2025-06-07 03:15:35] [INFO ] Computing symmetric may disable matrix : 472 transitions.
[2025-06-07 03:15:35] [INFO ] Applying decomposition
[2025-06-07 03:15:35] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 03:15:35] [INFO ] Computing symmetric may enable matrix : 472 transitions.
[2025-06-07 03:15:35] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 03:15:35] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16958354862258947180.txt' '-o' '/tmp/graph16958354862258947180.bin' '-w' '/tmp/graph16958354862258947180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16958354862258947180.bin' '-l' '-1' '-v' '-w' '/tmp/graph16958354862258947180.weights' '-q' '0' '-e' '0.001'
[2025-06-07 03:15:35] [INFO ] Decomposing Gal with order
[2025-06-07 03:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 03:15:35] [INFO ] Computing Do-Not-Accords matrix : 472 transitions.
[2025-06-07 03:15:35] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 03:15:35] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16329758180921125470
Running compilation step : cd /tmp/ltsmin16329758180921125470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 03:15:35] [INFO ] Removed a total of 340 redundant transitions.
[2025-06-07 03:15:35] [INFO ] Flatten gal took : 175 ms
[2025-06-07 03:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 28 ms.
[2025-06-07 03:15:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality4867650690483276296.gal : 4 ms
[2025-06-07 03:15:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality3640932367528875122.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4867650690483276296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3640932367528875122.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G((F((F("((((gu34.ClientsWaiting_0+gu34.ClientsWaiting_1)+(gu34.ClientsWaiting_2+gu34.ClientsWaiting_3))+((gu34.ClientsWaiting_4+gu...2324
Formula 0 simplified : F(G(G!"((((gu34.ClientsWaiting_0+gu34.ClientsWaiting_1)+(gu34.ClientsWaiting_2+gu34.ClientsWaiting_3))+((gu34.ClientsWaiting_4+gu34....2309
Compilation finished in 1125 ms.
Running link step : cd /tmp/ltsmin16329758180921125470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16329758180921125470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&X((LTLAPp1==true)))) U (X(X((LTLAPp2==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: LTL layer: formula: []((<>((<>((LTLAPp0==true))&&X((LTLAPp1==true)))) U (X(X((LTLAPp2==true)))||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.014: "[]((<>((<>((LTLAPp0==true))&&X((LTLAPp1==true)))) U (X(X((LTLAPp2==true)))||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.014: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.213: There are 476 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.213: State length is 303, there are 503 groups
pins2lts-mc-linux64( 0/ 8), 0.213: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.213: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.213: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.213: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.337: [Blue] ~5 levels ~960 states ~1784 transitions
pins2lts-mc-linux64( 2/ 8), 0.435: [Blue] ~8 levels ~1920 states ~4336 transitions
pins2lts-mc-linux64( 2/ 8), 0.598: [Blue] ~23 levels ~3840 states ~9976 transitions
pins2lts-mc-linux64( 2/ 8), 0.882: [Blue] ~64 levels ~7680 states ~16504 transitions
pins2lts-mc-linux64( 2/ 8), 1.153: [Blue] ~64 levels ~15360 states ~25720 transitions
pins2lts-mc-linux64( 2/ 8), 1.899: [Blue] ~64 levels ~30720 states ~45152 transitions
pins2lts-mc-linux64( 2/ 8), 3.001: [Blue] ~64 levels ~61440 states ~84984 transitions
pins2lts-mc-linux64( 2/ 8), 4.026: [Blue] ~64 levels ~122880 states ~166904 transitions
pins2lts-mc-linux64( 3/ 8), 5.632: [Blue] ~64 levels ~245760 states ~332320 transitions
pins2lts-mc-linux64( 3/ 8), 8.440: [Blue] ~64 levels ~491520 states ~675216 transitions
pins2lts-mc-linux64( 3/ 8), 13.734: [Blue] ~64 levels ~983040 states ~1362696 transitions
pins2lts-mc-linux64( 3/ 8), 24.134: [Blue] ~65 levels ~1966080 states ~2804008 transitions
pins2lts-mc-linux64( 3/ 8), 45.153: [Blue] ~70 levels ~3932160 states ~5694088 transitions
pins2lts-mc-linux64( 3/ 8), 101.168: [Blue] ~73 levels ~7864320 states ~11523192 transitions
pins2lts-mc-linux64( 4/ 8), 147.162: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 147.486:
pins2lts-mc-linux64( 0/ 8), 147.486: Explored 10109082 states 37536295 transitions, fanout: 3.713
pins2lts-mc-linux64( 0/ 8), 147.486: Total exploration time 147.270 sec (146.950 sec minimum, 147.084 sec on average)
pins2lts-mc-linux64( 0/ 8), 147.486: States per second: 68643, Transitions per second: 254881
pins2lts-mc-linux64( 0/ 8), 147.486:
pins2lts-mc-linux64( 0/ 8), 147.486: State space has 30252639 states, 5311065 are accepting
pins2lts-mc-linux64( 0/ 8), 147.486: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 147.486: blue states: 10109082 (33.42%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 147.486: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 147.486: all-red states: 7417797 (24.52%), bogus 4 (0.00%)
pins2lts-mc-linux64( 0/ 8), 147.486:
pins2lts-mc-linux64( 0/ 8), 147.486: Total memory used for local state coloring: 40.8MB
pins2lts-mc-linux64( 0/ 8), 147.486:
pins2lts-mc-linux64( 0/ 8), 147.486: Queue width: 8B, total height: 2676004, memory: 20.42MB
pins2lts-mc-linux64( 0/ 8), 147.486: Tree memory: 486.8MB, 16.9 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 147.486: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 147.486: Stored 474 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 147.486: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 147.486: Est. total memory use: 507.2MB (~1044.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16329758180921125470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&X((LTLAPp1==true)))) U (X(X((LTLAPp2==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16329758180921125470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&X((LTLAPp1==true)))) U (X(X((LTLAPp2==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-07 03:38:15] [INFO ] Applying decomposition
[2025-06-07 03:38:15] [INFO ] Flatten gal took : 17 ms
[2025-06-07 03:38:15] [INFO ] Decomposing Gal with order
[2025-06-07 03:38:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 03:38:15] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to Idles in partition [Clients_0, ControlRoomDispatch_0, Finished_0, ClientsWaiting_0, ClientsTimeout_0],[Clients_1, ControlRoomDispatch_1, Finished_1, ClientsWaiting_1, ClientsTimeout_1],[Clients_2, ControlRoomDispatch_2, Finished_2, ClientsWaiting_2, ClientsTimeout_2],[Clients_3, ControlRoomDispatch_3, Finished_3, ClientsWaiting_3, ClientsTimeout_3],[Clients_4, ControlRoomDispatch_4, Finished_4, ClientsWaiting_4, ClientsTimeout_4],[Clients_5, ControlRoomDispatch_5, Finished_5, ClientsWaiting_5, ClientsTimeout_5],[Clients_6, ControlRoomDispatch_6, Finished_6, ClientsWaiting_6, ClientsTimeout_6],[Clients_7, ControlRoomDispatch_7, Finished_7, ClientsWaiting_7, ClientsTimeout_7],[MovetoZ_0],[MovetoZ_1],[MovetoZ_2],[MovetoZ_3],[MovetoZ_4],[MovetoZ_5],[MovetoZ_6],[MovetoZ_7],[MovetoZ_8],[MovetoZ_9],[MovetoZ_10],[MovetoZ_11],[MovetoZ_12],[MovetoZ_13],[MovetoZ_14],[MovetoZ_15],[MovetoZ_16],[MovetoZ_17],[MovetoZ_18],[MovetoZ_19],[MovetoZ_20],[MovetoZ_21],[MovetoZ_22],[MovetoZ_23],[MovetoZ_24],[MovetoZ_25],[MovetoZ_26],[MovetoZ_27],[MovetoZ_28],[MovetoZ_29],[MovetoZ_30],[MovetoZ_31],[MovetoZ_32],[MovetoZ_33],[MovetoZ_34],[MovetoZ_35],[MovetoZ_36],[MovetoZ_37],[MovetoZ_38],[MovetoZ_39],[MovetoZ_40],[MovetoZ_41],[MovetoZ_42],[MovetoZ_43],[MovetoZ_44],[MovetoZ_45],[MovetoZ_46],[MovetoZ_47],[MovetoZ_48],[MovetoZ_49],[MovetoZ_50],[MovetoZ_51],[MovetoZ_52],[MovetoZ_53],[MovetoZ_54],[MovetoZ_55],[MovetoZ_56],[MovetoZ_57],[MovetoZ_58],[MovetoZ_59],[MovetoZ_60],[MovetoZ_61],[MovetoZ_62],[MovetoZ_63],[MovetoZ_64],[MovetoZ_65],[MovetoZ_66],[MovetoZ_67],[MovetoZ_68],[MovetoZ_69],[MovetoZ_70],[MovetoZ_71],[MovetoZ_72],[MovetoZ_73],[MovetoZ_74],[MovetoZ_75],[MovetoZ_76],[MovetoZ_77],[MovetoZ_78],[MovetoZ_79],[MovetoZ_80],[MovetoZ_81],[MovetoZ_82],[MovetoZ_83],[MovetoZ_84],[MovetoZ_85],[MovetoZ_86],[MovetoZ_87],[MovetoZ_88],[MovetoZ_89],[MovetoZ_90],[MovetoZ_91],[MovetoZ_92],[MovetoZ_93],[MovetoZ_94],[MovetoZ_95],[MovetoZ_96],[MovetoZ_97],[MovetoZ_98],[MovetoZ_99],[MovetoZ_100],[MovetoZ_101],[MovetoZ_102],[MovetoZ_103],[MovetoZ_104],[MovetoZ_105],[MovetoZ_106],[MovetoZ_107],[MovetoZ_108],[MovetoZ_109],[MovetoZ_110],[MovetoZ_111],[MovetoZ_112],[MovetoZ_113],[MovetoZ_114],[MovetoZ_115],[MovetoZ_116],[MovetoZ_117],[MovetoZ_118],[MovetoZ_119],[MovetoZ_120],[MovetoZ_121],[MovetoZ_122],[MovetoZ_123],[MovetoZ_124],[MovetoZ_125],[MovetoZ_126],[MovetoZ_127],[OpenRequests_0, Assigned_0, StartSecuring_0, DoSecuring_0],[OpenRequests_1, Assigned_1, StartSecuring_1, DoSecuring_1],[OpenRequests_2, Assigned_2, StartSecuring_2, DoSecuring_2],[OpenRequests_3, Assigned_3, StartSecuring_3, DoSecuring_3],[OpenRequests_4, Assigned_4, StartSecuring_4, DoSecuring_4],[OpenRequests_5, Assigned_5, StartSecuring_5, DoSecuring_5],[OpenRequests_6, Assigned_6, StartSecuring_6, DoSecuring_6],[OpenRequests_7, Assigned_7, StartSecuring_7, DoSecuring_7],[OpenRequests_8, Assigned_8, StartSecuring_8, DoSecuring_8],[OpenRequests_9, Assigned_9, StartSecuring_9, DoSecuring_9],[OpenRequests_10, Assigned_10, StartSecuring_10, DoSecuring_10],[OpenRequests_11, Assigned_11, StartSecuring_11, DoSecuring_11],[OpenRequests_12, Assigned_12, StartSecuring_12, DoSecuring_12],[OpenRequests_13, Assigned_13, StartSecuring_13, DoSecuring_13],[OpenRequests_14, Assigned_14, StartSecuring_14, DoSecuring_14],[OpenRequests_15, Assigned_15, StartSecuring_15, DoSecuring_15],[OpenRequests_16, Assigned_16, StartSecuring_16, DoSecuring_16],[OpenRequests_17, Assigned_17, StartSecuring_17, DoSecuring_17],[OpenRequests_18, Assigned_18, StartSecuring_18, DoSecuring_18],[OpenRequests_19, Assigned_19, StartSecuring_19, DoSecuring_19],[OpenRequests_20, Assigned_20, StartSecuring_20, DoSecuring_20],[OpenRequests_21, Assigned_21, StartSecuring_21, DoSecuring_21],[OpenRequests_22, Assigned_22, StartSecuring_22, DoSecuring_22],[OpenRequests_23, Assigned_23, StartSecuring_23, DoSecuring_23],[OpenRequests_24, Assigned_24, StartSecuring_24, DoSecuring_24],[OpenRequests_25, Assigned_25, StartSecuring_25, DoSecuring_25],[OpenRequests_26, Assigned_26, StartSecuring_26, DoSecuring_26],[OpenRequests_27, Assigned_27, StartSecuring_27, DoSecuring_27],[OpenRequests_28, Assigned_28, StartSecuring_28, DoSecuring_28],[OpenRequests_29, Assigned_29, StartSecuring_29, DoSecuring_29],[OpenRequests_30, Assigned_30, StartSecuring_30, DoSecuring_30],[OpenRequests_31, Assigned_31, StartSecuring_31, DoSecuring_31],[IdleTechs_0],[IdleTechs_1],[IdleTechs_2],[IdleTechs_3],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-07 03:38:15] [INFO ] Flatten gal took : 16 ms
[2025-06-07 03:38:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality18309720061725382659.gal : 3 ms
[2025-06-07 03:38:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality13992567917424819933.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18309720061725382659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13992567917424819933.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G((F((F("((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsW...1844
Formula 0 simplified : F(G(G!"((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsWait...1829
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 04:00:54] [INFO ] Flatten gal took : 16 ms
[2025-06-07 04:00:54] [INFO ] Input system was already deterministic with 472 transitions.
[2025-06-07 04:00:54] [INFO ] Transformed 302 places.
[2025-06-07 04:00:54] [INFO ] Transformed 472 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-07 04:00:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality11794458282371581318.gal : 3 ms
[2025-06-07 04:00:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality2512255374513477838.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11794458282371581318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2512255374513477838.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F((F("((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsW...1844
Formula 0 simplified : F(G(G!"((((ClientsWaiting_0+ClientsWaiting_1)+(ClientsWaiting_2+ClientsWaiting_3))+((ClientsWaiting_4+ClientsWaiting_5)+(ClientsWait...1829
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-Z4T3N08"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z4T3N08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915590300715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T3N08.tgz
mv UtilityControlRoom-COL-Z4T3N08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;