MCC'2024- Execution of r492-smll-171636266300163

About the Execution of LTSMin+red for EisenbergMcGuire-PT-05

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
887.239	517893.00	603887.00	1546.70	FFFFTTFFFFFFTFTT	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717222308842

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:11:51] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-06-01 06:11:52] [INFO ] Transformed 295 places.
[2024-06-01 06:11:52] [INFO ] Transformed 800 transitions.
[2024-06-01 06:11:52] [INFO ] Found NUPN structural information;
[2024-06-01 06:11:52] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 279 transition count 720
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 279 transition count 720
Applied a total of 32 rules in 154 ms. Remains 279 /295 variables (removed 16) and now considering 720/800 (removed 80) transitions.
[2024-06-01 06:11:52] [INFO ] Flow matrix only has 385 transitions (discarded 335 similar events)
// Phase 1: matrix 385 rows 279 cols
[2024-06-01 06:11:52] [INFO ] Computed 16 invariants in 38 ms
[2024-06-01 06:11:53] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-06-01 06:11:53] [INFO ] Flow matrix only has 385 transitions (discarded 335 similar events)
[2024-06-01 06:11:53] [INFO ] Invariant cache hit.
[2024-06-01 06:11:54] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 06:11:54] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-06-01 06:11:54] [INFO ] Flow matrix only has 385 transitions (discarded 335 similar events)
[2024-06-01 06:11:54] [INFO ] Invariant cache hit.
[2024-06-01 06:11:55] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 34 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 4 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 4 ms to minimize.
[2024-06-01 06:12:03] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 5 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 4 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 79 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:12:07] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:12:07] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:12:07] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:12:08] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:12:08] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-06-01 06:12:08] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 80 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:12:10] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:12:11] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 85 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 83 places in 277 ms of which 5 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:12:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 5 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 5 ms to minimize.
[2024-06-01 06:12:15] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-06-01 06:12:23] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:12:23] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 4 ms to minimize.
[2024-06-01 06:12:24] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 4 ms to minimize.
[2024-06-01 06:12:24] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:12:24] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:12:24] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 5 ms to minimize.
[2024-06-01 06:12:25] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:12:25] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:12:25] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/664 variables, and 65 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/279 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 5 ms to minimize.
[2024-06-01 06:12:28] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 5 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:12:29] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 5 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:12:31] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:12:31] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:12:34] [INFO ] Deduced a trap composed of 76 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:12:35] [INFO ] Deduced a trap composed of 67 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:12:35] [INFO ] Deduced a trap composed of 69 places in 320 ms of which 6 ms to minimize.
[2024-06-01 06:12:35] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:12:36] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:12:36] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:12:36] [INFO ] Deduced a trap composed of 98 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:12:37] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:12:37] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-06-01 06:12:39] [INFO ] Deduced a trap composed of 75 places in 299 ms of which 5 ms to minimize.
[2024-06-01 06:12:39] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 5 ms to minimize.
[2024-06-01 06:12:39] [INFO ] Deduced a trap composed of 95 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:12:40] [INFO ] Deduced a trap composed of 98 places in 309 ms of which 4 ms to minimize.
[2024-06-01 06:12:40] [INFO ] Deduced a trap composed of 92 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:12:40] [INFO ] Deduced a trap composed of 86 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:12:40] [INFO ] Deduced a trap composed of 78 places in 296 ms of which 5 ms to minimize.
[2024-06-01 06:12:41] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:12:41] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 5 ms to minimize.
[2024-06-01 06:12:42] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:12:44] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:12:44] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 5 ms to minimize.
[2024-06-01 06:12:45] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:12:45] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:12:51] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:12:51] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 70 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 5 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 81 places in 267 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 715 unsolved
(s34 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/664 variables, and 105 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/279 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/715 constraints, Known Traps: 89/89 constraints]
After SMT, in 60737ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Starting structural reductions in LTL mode, iteration 1 : 279/295 places, 720/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63347 ms. Remains : 279/295 places, 720/800 transitions.
Support contains 30 out of 279 places after structural reductions.
[2024-06-01 06:12:56] [INFO ] Flatten gal took : 160 ms
[2024-06-01 06:12:56] [INFO ] Flatten gal took : 105 ms
[2024-06-01 06:12:56] [INFO ] Input system was already deterministic with 720 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 2497 ms. (16 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2024-06-01 06:12:57] [INFO ] Flow matrix only has 385 transitions (discarded 335 similar events)
[2024-06-01 06:12:57] [INFO ] Invariant cache hit.
[2024-06-01 06:12:57] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 254/264 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/274 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 385/659 variables, 274/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 132/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 5/664 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/664 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 427 constraints, problems are : Problem set: 0 solved, 5 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 279/279 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 254/264 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/274 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 5 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 5 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-06-01 06:12:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:13:00] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 385/659 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 132/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 5/664 variables, 5/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/664 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:13:01] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 4 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/664 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/664 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 447 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 279/279 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 4856ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2859 ms.
Support contains 10 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 720/720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 279 transition count 715
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 274 transition count 715
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 10 place count 274 transition count 640
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 160 place count 199 transition count 640
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 196 transition count 625
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 196 transition count 625
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 204 place count 177 transition count 606
Applied a total of 204 rules in 131 ms. Remains 177 /279 variables (removed 102) and now considering 606/720 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 177/279 places, 606/720 transitions.
RANDOM walk for 40000 steps (8 resets) in 436 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 3136 steps, run visited all 5 properties in 63 ms. (steps per millisecond=49 )
Probabilistic random walk after 3136 steps, saw 2193 distinct states, run finished after 69 ms. (steps per millisecond=45 ) properties seen :5
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 279 transition count 715
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 274 transition count 715
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 274 transition count 637
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 196 transition count 637
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 170 place count 192 transition count 617
Iterating global reduction 2 with 4 rules applied. Total rules applied 174 place count 192 transition count 617
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 212 place count 173 transition count 598
Applied a total of 212 rules in 92 ms. Remains 173 /279 variables (removed 106) and now considering 598/720 (removed 122) transitions.
[2024-06-01 06:13:06] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
// Phase 1: matrix 263 rows 173 cols
[2024-06-01 06:13:06] [INFO ] Computed 16 invariants in 8 ms
[2024-06-01 06:13:06] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 06:13:06] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
[2024-06-01 06:13:06] [INFO ] Invariant cache hit.
[2024-06-01 06:13:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:13:07] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2024-06-01 06:13:07] [INFO ] Redundant transitions in 60 ms returned []
Running 593 sub problems to find dead transitions.
[2024-06-01 06:13:07] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
[2024-06-01 06:13:07] [INFO ] Invariant cache hit.
[2024-06-01 06:13:07] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:13:15] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:13:16] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:13:17] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:13:18] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:13:18] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:13:19] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:13:20] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:13:21] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:13:21] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:13:21] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:13:22] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:13:22] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:13:22] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:13:23] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:13:23] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:13:23] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:13:23] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:13:32] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:13:32] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:13:32] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:13:33] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:13:33] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 5 ms to minimize.
[2024-06-01 06:13:34] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:13:34] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:13:34] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:13:34] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:13:35] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/436 variables, and 66 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:13:44] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:13:47] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:13:48] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:13:48] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:14:00] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:14:01] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-06-01 06:14:07] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/436 variables, and 96 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/593 constraints, Known Traps: 80/80 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 173/279 places, 598/720 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61943 ms. Remains : 173/279 places, 598/720 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-00
Product exploration explored 100000 steps with 1068 reset in 564 ms.
Stack based approach found an accepted trace after 374 steps with 0 reset with depth 375 and stack size 281 in 5 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-00 finished in 62990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 276 transition count 705
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 276 transition count 705
Applied a total of 6 rules in 27 ms. Remains 276 /279 variables (removed 3) and now considering 705/720 (removed 15) transitions.
[2024-06-01 06:14:09] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-06-01 06:14:09] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:14:09] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 06:14:09] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:14:09] [INFO ] Invariant cache hit.
[2024-06-01 06:14:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 06:14:10] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-06-01 06:14:10] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:14:10] [INFO ] Invariant cache hit.
[2024-06-01 06:14:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:14:18] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:14:19] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2024-06-01 06:14:20] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 5 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 80 places in 298 ms of which 5 ms to minimize.
[2024-06-01 06:14:22] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:14:23] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:14:23] [INFO ] Deduced a trap composed of 84 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:14:23] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:14:24] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:14:24] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:14:25] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 5 ms to minimize.
[2024-06-01 06:14:25] [INFO ] Deduced a trap composed of 88 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 5 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 5 ms to minimize.
[2024-06-01 06:14:27] [INFO ] Deduced a trap composed of 69 places in 323 ms of which 5 ms to minimize.
[2024-06-01 06:14:27] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:14:27] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 5 ms to minimize.
[2024-06-01 06:14:27] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 5 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:14:28] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:14:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:14:30] [INFO ] Deduced a trap composed of 81 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:14:41] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 5 ms to minimize.
[2024-06-01 06:14:41] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 30615ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30628ms
Starting structural reductions in LTL mode, iteration 1 : 276/279 places, 705/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32126 ms. Remains : 276/279 places, 705/720 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-01 finished in 32279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 279 transition count 715
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 274 transition count 715
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 274 transition count 636
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 195 transition count 636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 191 transition count 616
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 214 place count 172 transition count 597
Applied a total of 214 rules in 78 ms. Remains 172 /279 variables (removed 107) and now considering 597/720 (removed 123) transitions.
[2024-06-01 06:14:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-06-01 06:14:41] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:14:41] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 06:14:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-06-01 06:14:41] [INFO ] Invariant cache hit.
[2024-06-01 06:14:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:14:42] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-06-01 06:14:42] [INFO ] Redundant transitions in 27 ms returned []
Running 592 sub problems to find dead transitions.
[2024-06-01 06:14:42] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-06-01 06:14:42] [INFO ] Invariant cache hit.
[2024-06-01 06:14:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:14:47] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 4 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 4 ms to minimize.
[2024-06-01 06:14:52] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:14:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:14:55] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:14:55] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:14:55] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:14:55] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:14:56] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:14:56] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:14:56] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:14:56] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:14:56] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:15:01] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:15:04] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:15:04] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:15:04] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:15:04] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:15:04] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:08] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:15:09] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/434 variables, and 85 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:15:15] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:15:17] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:15:18] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:15:19] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:15:19] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:15:19] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:15:20] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:21] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:15:21] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:15:23] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:15:23] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:15:23] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:15:23] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 53 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:15:24] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:15:25] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:15:26] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:27] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:15:30] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:15:30] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:15:30] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:15:33] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-06-01 06:15:37] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:15:37] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:15:37] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:15:38] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:15:38] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:15:39] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/434 variables, and 136 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/592 constraints, Known Traps: 120/120 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 172/279 places, 597/720 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61691 ms. Remains : 172/279 places, 597/720 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 365 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 39 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-03 finished in 62179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (F(p1)&&X(!p2)))))'
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 700
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 700
Applied a total of 8 rules in 17 ms. Remains 275 /279 variables (removed 4) and now considering 700/720 (removed 20) transitions.
[2024-06-01 06:15:43] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-06-01 06:15:43] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:15:44] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 06:15:44] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:15:44] [INFO ] Invariant cache hit.
[2024-06-01 06:15:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:15:45] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:15:45] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:15:45] [INFO ] Invariant cache hit.
[2024-06-01 06:15:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 4 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:15:57] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 5 ms to minimize.
[2024-06-01 06:15:57] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:15:57] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:15:58] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:15:58] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 5 ms to minimize.
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 5 ms to minimize.
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 5 ms to minimize.
[2024-06-01 06:16:00] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:16:00] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:16:00] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:16:00] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:16:01] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:16:01] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 5 ms to minimize.
[2024-06-01 06:16:01] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:16:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:16:03] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:16:03] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 5 ms to minimize.
[2024-06-01 06:16:03] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 77 places in 311 ms of which 4 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 5 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 5 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 5 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 68 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:16:17] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 5 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 77 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:16:21] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 5 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 95 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 81 places in 302 ms of which 5 ms to minimize.
[2024-06-01 06:16:22] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 5 ms to minimize.
[2024-06-01 06:16:23] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:16:24] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 5 ms to minimize.
[2024-06-01 06:16:25] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:16:26] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:16:27] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 4 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:16:29] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:16:30] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 5 ms to minimize.
[2024-06-01 06:16:30] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 5 ms to minimize.
[2024-06-01 06:16:30] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:16:31] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:16:33] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:16:34] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:16:34] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:16:35] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:16:36] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:16:36] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 5 ms to minimize.
[2024-06-01 06:16:41] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:16:41] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:16:41] [INFO ] Deduced a trap composed of 53 places in 260 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:16:43] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:16:43] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:16:43] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:16:44] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:16:44] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:16:45] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:16:45] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:16:45] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 4 ms to minimize.
SMT process timed out in 60563ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 275/279 places, 700/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61979 ms. Remains : 275/279 places, 700/720 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), p2, (NOT p1), p2, true, (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 1 reset in 264 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-07 finished in 62684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 700
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 700
Applied a total of 8 rules in 15 ms. Remains 275 /279 variables (removed 4) and now considering 700/720 (removed 20) transitions.
[2024-06-01 06:16:46] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:16:46] [INFO ] Invariant cache hit.
[2024-06-01 06:16:46] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-01 06:16:46] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:16:46] [INFO ] Invariant cache hit.
[2024-06-01 06:16:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:16:47] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:16:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:16:47] [INFO ] Invariant cache hit.
[2024-06-01 06:16:47] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:16:55] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:16:55] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 4 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:16:59] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-06-01 06:16:59] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:16:59] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:17:00] [INFO ] Deduced a trap composed of 60 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:17:00] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:17:00] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:17:00] [INFO ] Deduced a trap composed of 46 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 5 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:17:05] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:17:05] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:17:05] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:17:06] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 4 ms to minimize.
[2024-06-01 06:17:07] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:17:14] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:17:14] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 4 ms to minimize.
[2024-06-01 06:17:15] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:17:15] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:17:15] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 5 ms to minimize.
[2024-06-01 06:17:15] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 4 ms to minimize.
[2024-06-01 06:17:16] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:17:16] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:17:16] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:17:17] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:17:17] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:17:17] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:17:18] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 4 ms to minimize.
SMT process timed out in 30602ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30617ms
Starting structural reductions in LTL mode, iteration 1 : 275/279 places, 700/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32118 ms. Remains : 275/279 places, 700/720 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-08 finished in 32267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((!p0 U (G(!p0)||(!p0&&G(p1))))))))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 277 transition count 710
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 277 transition count 710
Applied a total of 4 rules in 12 ms. Remains 277 /279 variables (removed 2) and now considering 710/720 (removed 10) transitions.
[2024-06-01 06:17:18] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-06-01 06:17:18] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:17:19] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 06:17:19] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:17:19] [INFO ] Invariant cache hit.
[2024-06-01 06:17:19] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:17:20] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-06-01 06:17:20] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:17:20] [INFO ] Invariant cache hit.
[2024-06-01 06:17:20] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 7 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:17:30] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 4 ms to minimize.
[2024-06-01 06:17:30] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:17:31] [INFO ] Deduced a trap composed of 80 places in 314 ms of which 5 ms to minimize.
[2024-06-01 06:17:31] [INFO ] Deduced a trap composed of 87 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:17:31] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:17:31] [INFO ] Deduced a trap composed of 89 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 5 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:17:32] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:17:33] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:17:33] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:17:33] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:17:34] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:17:34] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:17:34] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:17:35] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:17:35] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:17:37] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:17:37] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:17:37] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:17:37] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:17:38] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:17:38] [INFO ] Deduced a trap composed of 83 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:17:38] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:17:39] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:17:40] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 5 ms to minimize.
[2024-06-01 06:17:40] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:17:49] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 57 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 7 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 79 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:17:55] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 85 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 80 places in 266 ms of which 5 ms to minimize.
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 5 ms to minimize.
[2024-06-01 06:18:01] [INFO ] Deduced a trap composed of 77 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:18:01] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 5 ms to minimize.
[2024-06-01 06:18:01] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:18:02] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:18:02] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:18:03] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 5 ms to minimize.
[2024-06-01 06:18:04] [INFO ] Deduced a trap composed of 67 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:18:04] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:18:04] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:18:04] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:18:05] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 5 ms to minimize.
[2024-06-01 06:18:05] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:18:05] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:18:05] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 4 ms to minimize.
[2024-06-01 06:18:07] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:18:14] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:18:14] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:18:15] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:18:15] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:18:16] [INFO ] Deduced a trap composed of 87 places in 301 ms of which 4 ms to minimize.
[2024-06-01 06:18:16] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:18:18] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:18:19] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 99 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 83/83 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Starting structural reductions in LTL mode, iteration 1 : 277/279 places, 710/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62110 ms. Remains : 277/279 places, 710/720 transitions.
Stuttering acceptance computed with spot in 341 ms :[p0, p0, p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-09 finished in 62772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((F(p2)||p1))))))'
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 276 transition count 705
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 276 transition count 705
Applied a total of 6 rules in 12 ms. Remains 276 /279 variables (removed 3) and now considering 705/720 (removed 15) transitions.
[2024-06-01 06:18:21] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-06-01 06:18:21] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:18:21] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 06:18:21] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:18:21] [INFO ] Invariant cache hit.
[2024-06-01 06:18:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 06:18:23] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-06-01 06:18:23] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:18:23] [INFO ] Invariant cache hit.
[2024-06-01 06:18:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 4 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 5 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 51 places in 305 ms of which 4 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 55 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:18:38] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:18:38] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 5 ms to minimize.
[2024-06-01 06:18:38] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:18:39] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:18:39] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:18:39] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:18:39] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:18:40] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:18:40] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:18:40] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:18:40] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:18:41] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:18:42] [INFO ] Deduced a trap composed of 70 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:18:42] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:18:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:18:49] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:18:51] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 59 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 81 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 4 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/646 variables, and 69 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:18:56] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:18:56] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:18:56] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 89 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:18:59] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:18:59] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:18:59] [INFO ] Deduced a trap composed of 77 places in 310 ms of which 5 ms to minimize.
[2024-06-01 06:19:00] [INFO ] Deduced a trap composed of 53 places in 299 ms of which 5 ms to minimize.
[2024-06-01 06:19:00] [INFO ] Deduced a trap composed of 94 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:19:00] [INFO ] Deduced a trap composed of 87 places in 319 ms of which 4 ms to minimize.
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:19:03] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:19:03] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:19:04] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 5 ms to minimize.
[2024-06-01 06:19:04] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:19:05] [INFO ] Deduced a trap composed of 80 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:19:05] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:19:05] [INFO ] Deduced a trap composed of 77 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:19:07] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:19:07] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:19:13] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:19:14] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:19:15] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 4 ms to minimize.
[2024-06-01 06:19:16] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:19:16] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:19:17] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:19:17] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:19:18] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/646 variables, and 108 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 92/92 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Starting structural reductions in LTL mode, iteration 1 : 276/279 places, 705/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62232 ms. Remains : 276/279 places, 705/720 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 43 reset in 232 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-10 finished in 62735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p0))))))'
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 720/720 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 700
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 700
Applied a total of 8 rules in 11 ms. Remains 275 /279 variables (removed 4) and now considering 700/720 (removed 20) transitions.
[2024-06-01 06:19:24] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-06-01 06:19:24] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:19:24] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 06:19:24] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:19:24] [INFO ] Invariant cache hit.
[2024-06-01 06:19:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:19:25] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:19:25] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:19:25] [INFO ] Invariant cache hit.
[2024-06-01 06:19:25] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:19:33] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:19:34] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:19:34] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 4 ms to minimize.
[2024-06-01 06:19:34] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:19:34] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:19:34] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:19:36] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 5 ms to minimize.
[2024-06-01 06:19:36] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 5 ms to minimize.
[2024-06-01 06:19:37] [INFO ] Deduced a trap composed of 72 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:19:37] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:19:37] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:19:38] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 4 ms to minimize.
[2024-06-01 06:19:38] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 5 ms to minimize.
[2024-06-01 06:19:38] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:19:39] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 3 ms to minimize.
[2024-06-01 06:19:39] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:19:40] [INFO ] Deduced a trap composed of 57 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:19:40] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:19:40] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 80 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:19:43] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 64 places in 301 ms of which 5 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 77 places in 292 ms of which 5 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:19:53] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:19:53] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:19:53] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 5 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:19:55] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:19:55] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:19:56] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 68 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 4 ms to minimize.
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:19:59] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:19:59] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:19:59] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 4 ms to minimize.
[2024-06-01 06:19:59] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 4 ms to minimize.
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 77 places in 296 ms of which 5 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 95 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:20:02] [INFO ] Deduced a trap composed of 81 places in 308 ms of which 5 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 4 ms to minimize.
[2024-06-01 06:20:03] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:20:04] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:20:06] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:20:06] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:20:08] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:20:09] [INFO ] Deduced a trap composed of 55 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:20:09] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:20:09] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:20:09] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:20:10] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 5 ms to minimize.
[2024-06-01 06:20:10] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:20:10] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:20:11] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:20:11] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:20:11] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:20:12] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:20:13] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 4 ms to minimize.
[2024-06-01 06:20:13] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 4 ms to minimize.
[2024-06-01 06:20:15] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:20:20] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:20:20] [INFO ] Deduced a trap composed of 59 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:20:20] [INFO ] Deduced a trap composed of 53 places in 257 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:20:23] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:20:23] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 56 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 5 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 118 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 102/102 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 275/279 places, 700/720 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62089 ms. Remains : 275/279 places, 700/720 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-13
Product exploration explored 100000 steps with 36 reset in 224 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-13 finished in 62498 ms.
All properties solved by simple procedures.
Total runtime 515221 ms.
ITS solved all properties within timeout

BK_STOP 1717222826735

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-05, 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 r492-smll-171636266300163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;